| Publication | Date of Publication | Type |
|---|
| On uniformization in the full binary tree | 2024-08-06 | Paper |
| A complete axiomatisation for trace congruence of finite state behaviors | 2023-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875689 | 2023-02-03 | Paper |
| From finite automata toward hybrid systems (Extended abstract) | 2022-12-09 | Paper |
| The Expressive Power of Temporal and First-Order Metric Logics | 2022-11-09 | Paper |
| On nets, algebras and modularity | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089255 | 2022-07-18 | Paper |
| Boris Abramovich Trakhtenbrot | 2022-05-09 | Paper |
| On degrees of ambiguity for Büchi tree automata | 2021-11-25 | Paper |
| Checking equivalences between concurrent systems of finite agents (Extended abstract) | 2019-12-04 | Paper |
| Some complexity results for stateful network verification | 2019-11-18 | Paper |
| Complementation of finitely ambiguous Büchi automata | 2018-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4637684 | 2018-04-25 | Paper |
| On compositionality and its limitations | 2017-07-12 | Paper |
| Interpretations in Trees with Countably Many Branches | 2017-05-16 | Paper |
| On Expressive Power of Regular Expressions over Infinite Orders | 2016-07-25 | Paper |
| No future without (\textit{a hint of}) past. A finite basis for `almost future' temporal logic | 2016-03-10 | Paper |
| On Almost Future Temporal Logics | 2015-09-22 | Paper |
| The complexity of multi-mean-payoff and multi-energy games | 2015-05-04 | Paper |
| A Proof of Kamp's theorem | 2014-03-24 | Paper |
| An Unusual Temporal Logic | 2013-09-20 | Paper |
| The probability nesting game | 2013-08-15 | Paper |
| The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates | 2012-11-27 | Paper |
| A Proof of Kamp's theorem | 2012-11-22 | Paper |
| Synthesis of Finite-state and Definable Winning Strategies. | 2012-10-24 | Paper |
| A Finite Basis for ‘Almost Future’ Temporal Logic over the Reals | 2012-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2915691 | 2012-09-18 | Paper |
| On countable chains having decidable monadic theory | 2012-06-19 | Paper |
| Temporal logics over linear time domains are in PSPACE | 2012-05-24 | Paper |
| Continuous time temporal logic with counting | 2012-05-24 | Paper |
| Selection over classes of ordinals expanded by monadic predicates | 2011-08-26 | Paper |
| Expressing cardinality quantifiers in monadic second-order logic over chains | 2011-06-28 | Paper |
| Decidable Expansions of Labelled Linear Orderings | 2011-05-26 | Paper |
| Church Synthesis Problem for Noisy Input | 2011-05-19 | Paper |
| The complexity of linear-time temporal logic over the class of ordinals | 2011-03-08 | Paper |
| The full binary tree cannot be interpreted in a chain | 2011-01-12 | Paper |
| Decidable Expansions of Labelled Linear Orderings | 2010-09-03 | Paper |
| Temporal Logics over Linear Time Domains Are in PSPACE | 2010-08-31 | Paper |
| Complexity of metric temporal logics with counting and the Pnueli modalities | 2010-05-27 | Paper |
| On the Borel Complexity of MSO Definable Sets of Branches | 2010-05-25 | Paper |
| Computing partial information out of intractable: powers of algebraic numbers as an example | 2010-01-08 | Paper |
| Decidable fragments of many-sorted logic | 2009-12-03 | Paper |
| Cardinality Quantifiers in MLO over Trees | 2009-11-12 | Paper |
| Decidable Extensions of Church’s Problem | 2009-11-12 | Paper |
| Time-Bounded Verification | 2009-10-22 | Paper |
| The Church Problem for Countable Ordinals | 2009-06-30 | Paper |
| Selection in the monadic theory of a countable ordinal | 2009-03-23 | Paper |
| Church Synthesis Problem with Parameters | 2009-03-12 | Paper |
| Decidable Theories of the Ordering of Natural Numbers with Unary Predicates | 2009-03-12 | Paper |
| Logical Refinements of Church’s Problem | 2009-03-05 | Paper |
| Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities | 2008-12-02 | Paper |
| Arity hierarchy for temporal logics | 2008-09-16 | Paper |
| Decidability and Expressive Power of Real Time Logics | 2008-07-08 | Paper |
| Decidable Fragments of Many-Sorted Logic | 2008-05-15 | Paper |
| The Complexity of Temporal Logic with Until and Since over Ordinals | 2008-05-15 | Paper |
| The Church Synthesis Problem with Parameters | 2008-04-01 | Paper |
| Boris A. Trakhtenbrot: Academic Genealogy and Publications | 2008-03-25 | Paper |
| Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey | 2008-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5422269 | 2007-10-17 | Paper |
| Expressiveness of Metric modalities for continuous time | 2007-10-11 | Paper |
| An Expressive Temporal Logic for Real Time | 2007-09-05 | Paper |
| A logic of reachable patterns in linked data-structures | 2007-08-23 | Paper |
| On decidability of monadic logic of order over the naturals extended by monadic predicates | 2007-07-16 | Paper |
| Temporal logics with incommensurable distances are undecidable | 2007-05-14 | Paper |
| Foundations of Software Science and Computation Structures | 2007-05-02 | Paper |
| Expressiveness of Metric Modalities for Continuous Time | 2007-05-02 | Paper |
| A Logic of Probability with Decidable Model Checking | 2006-12-04 | Paper |
| \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) | 2006-08-16 | Paper |
| Quantitative analysis of probabilistic lossy channel systems | 2006-06-30 | Paper |
| Verification of probabilistic systems with faulty communication | 2005-11-22 | Paper |
| Computer Aided Verification | 2005-08-25 | Paper |
| Timer formulas and decidable metric temporal logic | 2005-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4824483 | 2004-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4824486 | 2004-11-01 | Paper |
| Selection and Uniformization in Generalized Product | 2004-10-21 | Paper |
| Future temporal logic needs infinitely many modalities | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449237 | 2004-02-08 | Paper |
| Automata over continuous time | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417850 | 2003-07-30 | Paper |
| Counting on CTL\(^*\): On the expressive power of monadic path logic | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411831 | 2003-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484477 | 2003-06-12 | Paper |
| Expressive completeness of duration calculus. | 2003-01-14 | Paper |
| An infinite hierarchy of temporal logics over branching time | 2003-01-14 | Paper |
| Decidability of split equivalence | 2003-01-14 | Paper |
| Definability in Rationals with Real Order in the Background | 2002-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536399 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150251 | 2002-09-30 | Paper |
| Finite variability interpretation of monadic logic of order | 2002-07-31 | Paper |
| Monadic Logic of Order over Naturals has no Finite Base | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757837 | 2001-12-04 | Paper |
| Definability and undefinability with real order at the background | 2001-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500374 | 2001-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945224 | 2000-09-05 | Paper |
| Star free expressions over the reals | 2000-08-23 | Paper |
| Symbolic model checking for \(\mu\)-calculus requires exponential time | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938638 | 2000-07-05 | Paper |
| On the decidability of continuous time specification formalisms | 1999-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222923 | 1998-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218103 | 1998-11-11 | Paper |
| On schematological equivalence of partially interpreted dataflow networks | 1998-09-27 | Paper |
| Modularity and expressibility for nets of relations | 1998-08-20 | Paper |
| On translations of temporal logic of actions into monadic second-order logic | 1998-08-13 | Paper |
| Non-elementary lower bound for Propositional Duration Calculus | 1998-08-13 | Paper |
| Complexity of equivalence problems for concurrent systems of finite agents | 1998-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4353635 | 1997-09-10 | Paper |
| On schematological equivalence of dataflow networks | 1996-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038700 | 1993-05-18 | Paper |
| Connectedness and synchronization | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204054 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3833596 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4733393 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3805922 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3814772 | 1987-01-01 | Paper |
