| Publication | Date of Publication | Type |
|---|
| Unary and two-variable interval logics | 2024-09-11 | Paper |
Two ways to scare a Gruffalo
Logic and Its Applications | 2023-08-17 | Paper |
| scientific article; zbMATH DE number 7533353 (Why is no real title available?) | 2022-05-28 | Paper |
scientific article; zbMATH DE number 7269244 (Why is no real title available?)
(available as arXiv preprint) | 2020-11-03 | Paper |
| scientific article; zbMATH DE number 7269244 (Why is no real title available?) | 2020-11-03 | Paper |
Decidability of a partial order based temporal logic
Automata, Languages and Programming | 2019-03-29 | Paper |
Two-variable logic with a between relation
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| Two-variable first order logic with counting quantifiers: complexity results | 2017-10-13 | Paper |
Stéphane Demri, Valentin Goranko, and Martin Lange, Temporal Logics in Computer Science: Finite-state Systems, Cambridge Tracts in Theoretical Computer Science, vol. 58, Cambridge University Press, Cambridge, 2016, viii + 744 pp.
The Bulletin of Symbolic Logic | 2017-10-06 | Paper |
Kleene Theorems for Synchronous Products with Matching
Transactions on Petri Nets and Other Models of Concurrency X | 2017-06-20 | Paper |
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Electronic Notes in Theoretical Computer Science | 2015-03-23 | Paper |
A language-theoretic view of verification
Modern Applications of Automata Theory | 2013-02-26 | Paper |
| Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE | 2012-10-24 | Paper |
Fine-grained concurrency with separation logic
Journal of Philosophical Logic | 2012-03-09 | Paper |
Parameterized Complexity Results for 1-safe Petri Nets
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Kleene theorems for product systems
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
| scientific article; zbMATH DE number 5896741 (Why is no real title available?) | 2011-05-18 | Paper |
LTL Can Be More Succinct
Automated Technology for Verification and Analysis | 2010-10-04 | Paper |
Around dot depth two
Developments in Language Theory | 2010-08-31 | Paper |
Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
Lecture Notes in Computer Science | 2009-08-11 | Paper |
| scientific article; zbMATH DE number 5587276 (Why is no real title available?) | 2009-07-27 | Paper |
A Dose of Timed Logic, in Guarded Measure
Lecture Notes in Computer Science | 2008-07-08 | Paper |
| A regular viewpoint on processes and algebra | 2007-10-26 | Paper |
Rationality in algebras with a series operation
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1773086 (Why is no real title available?) | 2002-07-28 | Paper |
| scientific article; zbMATH DE number 1696444 (Why is no real title available?) | 2002-06-25 | Paper |
Models and logics for true concurrency.
Sādhanā | 2002-02-18 | Paper |
Series-parallel languages and the bounded-width property
Theoretical Computer Science | 2000-06-04 | Paper |
| scientific article; zbMATH DE number 1302032 (Why is no real title available?) | 1999-06-16 | Paper |
| scientific article; zbMATH DE number 1136090 (Why is no real title available?) | 1998-04-01 | Paper |
A logical study of distributed transition systems
Information and Computation | 1995-08-01 | Paper |
TEMPORAL LOGICS FOR COMMUNICATING SEQUENTIAL AGENTS: I
International Journal of Foundations of Computer Science | 1993-01-16 | Paper |
Proof theory for exception handling in a tasking environment
Acta Informatica | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4119639 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4049019 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3901999 (Why is no real title available?) | 1985-01-01 | Paper |
