UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

A complete classification of the expressiveness of interval logics of Allen’s relations: the general and the dense cases

Acta informatica, 2016-04, Vol.53 (3), p.207-246

2016

Volltextzugriff (PDF)

A word on 7 letters which is non-repetitive up to mod 5

Acta informatica, 2003-06, Vol.39 (6-7), p.451-468

2003

Volltextzugriff (PDF)

Words, univalent factors, and boxes

Acta informatica, 2002-04, Vol.38 (6), p.409-436

2002

Volltextzugriff (PDF)

Checking interval properties of computations

Acta informatica, 2016-10, Vol.53 (6-8), p.587-619

2016

Volltextzugriff (PDF)

A general account of coinduction up-to

Acta informatica, 2017-03, Vol.54 (2), p.127-190

2017

Volltextzugriff (PDF)

Verification of population protocols

Acta informatica, 2017-03, Vol.54 (2), p.191-215

2017

Volltextzugriff (PDF)

Reachability analysis of linear systems

Acta informatica, 2024-09, Vol.61 (3), p.231-260

2024

Volltextzugriff (PDF)

Reversible sessions with flexible choices

Acta informatica, 2019-11, Vol.56 (7-8), p.553-583

2019

Volltextzugriff (PDF)

On deterministic sensing 5′→3′ Watson–Crick finite automata: a full hierarchy in 2detLIN

Acta informatica, 2021-06, Vol.58 (3), p.153-175

2021

Volltextzugriff (PDF)

A tool for deciding the satisfiability of continuous-time metric temporal logic

Acta informatica, 2016-03, Vol.53 (2), p.171-206

2016

Volltextzugriff (PDF)

On the size of partial derivatives and the word membership problem

Acta informatica, 2021-08, Vol.58 (4), p.357-375

2021

Volltextzugriff (PDF)

Symbolic checking of Fuzzy CTL on Fuzzy Program Graph

Acta informatica, 2019-02, Vol.56 (1), p.1-33

2019

Volltextzugriff (PDF)

Reactive synthesis without regret

Acta informatica, 2017-02, Vol.54 (1), p.3-39

2017

Volltextzugriff (PDF)

Metric propositional neighborhood logic with an equivalence relation

Acta informatica, 2016-10, Vol.53 (6-8), p.621-648

2016

Volltextzugriff (PDF)

Arithmetical datatypes with true fractions

Acta informatica, 2020-10, Vol.57 (3-5), p.385-402

2020

Volltextzugriff (PDF)

Generalized contexts for reaction systems: definition and study of dynamic causalities

Acta informatica, 2018-05, Vol.55 (3), p.227-267

2018

Volltextzugriff (PDF)

On the probabilistic bisimulation spectrum with silent moves

Acta informatica, 2020-10, Vol.57 (3-5), p.465-512

2020

Volltextzugriff (PDF)

A complete axiomatization of weighted branching bisimulation

Acta informatica, 2020-10, Vol.57 (3-5), p.689-725

2020

Volltextzugriff (PDF)

Step traces

Acta informatica, 2016-02, Vol.53 (1), p.35-65

2016

Volltextzugriff (PDF)

On reversible Turing machines and their function universality

Acta informatica, 2016-08, Vol.53 (5), p.509-543

2016

Volltextzugriff (PDF)

Petri nets are dioids: a new algebraic foundation for non-deterministic net theory

Acta informatica, 2019-02, Vol.56 (1), p.61-92

2019

Volltextzugriff (PDF)

Distributive laws for monotone specifications

Acta informatica, 2019-11, Vol.56 (7-8), p.585-617

Rot, Jurriaan

2019

Volltextzugriff (PDF)

CCS: It’s not fair: Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions

Acta informatica, 2015-04, Vol.52 (2-3), p.175-205

2015

Volltextzugriff (PDF)

Sparsification and subexponential approximation

Acta informatica, 2018-02, Vol.55 (1), p.1-15

2018

Volltextzugriff (PDF)

Synthesis and reengineering of persistent systems

Acta informatica, 2015-02, Vol.52 (1), p.35-60

2015

Volltextzugriff (PDF)

1 – 25 von 46

Menü

Weitere Dienste

Einstellungen

A complete classification of the expressiveness of interval logics of Allen’s relations: the general and the dense cases

A word on 7 letters which is non-repetitive up to mod 5

Words, univalent factors, and boxes

Checking interval properties of computations

A general account of coinduction up-to

Verification of population protocols

Reachability analysis of linear systems

Reversible sessions with flexible choices

On deterministic sensing 5′→3′ Watson–Crick finite automata: a full hierarchy in 2detLIN

A tool for deciding the satisfiability of continuous-time metric temporal logic

On the size of partial derivatives and the word membership problem

Symbolic checking of Fuzzy CTL on Fuzzy Program Graph

Reactive synthesis without regret

Metric propositional neighborhood logic with an equivalence relation

Arithmetical datatypes with true fractions

Generalized contexts for reaction systems: definition and study of dynamic causalities

On the probabilistic bisimulation spectrum with silent moves

A complete axiomatization of weighted branching bisimulation

Step traces

On reversible Turing machines and their function universality

Petri nets are dioids: a new algebraic foundation for non-deterministic net theory

Distributive laws for monotone specifications

CCS: It’s not fair: Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions

Sparsification and subexponential approximation

Synthesis and reengineering of persistent systems

Aktive Filter

Suchergebnisse filtern