| Publication | Date of Publication | Type |
|---|
| Fast algorithms for handling diagonal constraints in timed automata | 2024-02-16 | Paper |
| Asynchronous cellular automata for pomsets without auto-concurrency | 2023-06-28 | Paper |
| Zone-based verification of timed automata: extrapolations, simulations and what next? | 2023-01-18 | Paper |
| Removing ε-transitions in timed automata | 2022-11-09 | Paper |
| Revisiting Underapproximate Reachability for Multipushdown Systems | 2022-10-13 | Paper |
| Poset properties of complex traces | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5094152 | 2022-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092440 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089194 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089284 | 2022-07-18 | Paper |
| Weighted Automata and Weighted Logics | 2022-04-28 | Paper |
| Fast zone-based algorithms for reachability in pushdown timed automata | 2022-03-25 | Paper |
| Regular transducer expressions for regular transformations | 2022-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009419 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009444 | 2021-08-04 | Paper |
| Regular transducer expressions for regular transformations | 2021-01-20 | Paper |
| Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic | 2020-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304111 | 2020-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3299221 | 2020-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111654 | 2020-05-27 | Paper |
| Modular descriptions of regular functions | 2020-04-29 | Paper |
| Asynchronous cellular automata for infinite traces | 2019-12-04 | Paper |
| A domain for concurrent termination a generalization of Mazurkiewicz traces | 2019-01-10 | Paper |
| A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties | 2018-10-22 | Paper |
| On recognizable and rational formal power series in partially commuting variables | 2018-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643961 | 2018-05-30 | Paper |
| Logical characterization of weighted pebble walking automata | 2018-04-23 | Paper |
| An automata-theoretic approach to the verification of distributed algorithms | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608679 | 2018-03-21 | Paper |
| On the power of non-observable actions in timed automata | 2017-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5357714 | 2017-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2978552 | 2017-04-25 | Paper |
| Verification of Parameterized Communicating Automata via Split-Width | 2016-06-10 | Paper |
| Verifying Communicating Multi-pushdown Systems via Split-Width | 2015-12-17 | Paper |
| Parameterized Verification of Communicating Automata under Context Bounds | 2015-10-28 | Paper |
| Fair Synthesis for Asynchronous Distributed Systems | 2015-09-17 | Paper |
| Checking conformance for time-constrained scenario-based specifications | 2015-07-24 | Paper |
| Temporal logics for concurrent recursive programs: satisfiability and model checking | 2014-11-20 | Paper |
| Controllers for the Verification of Communicating Multi-pushdown Systems | 2014-09-15 | Paper |
| Pebble Weighted Automata and Weighted Logics | 2014-07-17 | Paper |
| Event clock message passing automata: a logical characterization and an emptiness checking algorithm | 2014-06-30 | Paper |
| Distributed Timed Automata with Independently Evolving Clocks | 2014-05-14 | Paper |
| Adding pebbles to weighted automata: easy specification \& efficient evaluation | 2014-04-29 | Paper |
| Decidability of well-connectedness for distributed synthesis | 2013-03-21 | Paper |
| Weighted Specifications over Nested Words | 2013-03-18 | Paper |
| Specification and Verification using Temporal Logics | 2013-02-26 | Paper |
| A Probabilistic Kleene Theorem | 2012-11-21 | Paper |
| MSO Decidability of Multi-Pushdown Systems via Split-Width | 2012-09-25 | Paper |
| Adding Pebbles to Weighted Automata | 2012-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908850 | 2012-08-29 | Paper |
| Model Checking Languages of Data Words | 2012-06-22 | Paper |
| Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking | 2011-08-17 | Paper |
| Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets | 2011-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086925 | 2011-03-30 | Paper |
| Pebble Weighted Automata and Transitive Closure Logics | 2010-09-07 | Paper |
| Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces | 2010-08-18 | Paper |
| On congruences and partial orders | 2010-06-17 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| Distributed synthesis for well-connected architectures | 2009-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5190776 | 2009-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5190778 | 2009-07-27 | Paper |
| Weighted versus Probabilistic Logics | 2009-07-07 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems | 2009-02-03 | Paper |
| Distributed Timed Automata with Independently Evolving Clocks | 2008-11-25 | Paper |
| A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS | 2008-11-24 | Paper |
| A Fresh Look at Testing for Asynchronous Communication | 2008-09-04 | Paper |
| Intersection of Regular Signal-Event (Timed) Languages | 2008-07-08 | Paper |
| Refinements and Abstractions of Signal-Event (Timed) Languages | 2008-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3504344 | 2008-06-11 | Paper |
| On aperiodic and star-free formal power series in partially commuting variables | 2008-06-06 | Paper |
| Automata and Logics for Timed Message Sequence Charts | 2008-04-24 | Paper |
| Distributed Synthesis for Well-Connected Architectures | 2008-04-17 | Paper |
| Local Testing of Message Sequence Charts Is Difficult | 2008-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5431918 | 2008-01-02 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Timed substitutions for regular signal-event languages | 2007-10-11 | Paper |
| Model Checking Software | 2007-09-28 | Paper |
| Weighted automata and weighted logics | 2007-07-16 | Paper |
| Pure future local temporal logics are expressively complete for Mazurkiewicz traces | 2007-01-22 | Paper |
| CONCUR 2005 – Concurrency Theory | 2006-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485974 | 2006-09-06 | Paper |
| From local to global temporal logics over Mazurkiewicz traces. | 2006-05-18 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Local temporal logic is expressively complete for cograph dependence alphabets | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737221 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738286 | 2004-08-11 | Paper |
| A simple process algebra based on atomic actions with resources | 2004-05-27 | Paper |
| The Kleene-Schützenberger theorem for formal power series in partially commuting variables. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551134 | 2002-09-04 | Paper |
| LTL is expressively complete for Mazurkiewicz traces | 2002-08-04 | Paper |
| A truly concurrent semantics for a process algebra using resource pomsets | 2002-07-15 | Paper |
| Resource traces: A domain for processes sharing exclusive resources. | 2002-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4531763 | 2002-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2763968 | 2002-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754145 | 2001-11-11 | Paper |
| Asynchronous cellular automata for pomsets | 2000-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502531 | 2000-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945225 | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945248 | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264103 | 1999-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218111 | 1999-06-21 | Paper |
| Approximating traces | 1999-01-11 | Paper |
| Rational and recognizable complex trace languages | 1995-04-10 | Paper |
| An extension of Kleene's and Ochmański's theorems to infinite traces | 1994-04-05 | Paper |
| The poset of infinitary traces | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035234 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035660 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036568 | 1993-05-18 | Paper |
| Decidability of the star problem in \(A^*\times{}\{ b\}^*\) | 1993-01-17 | Paper |
| Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems) | 1990-01-01 | Paper |
