| Publication | Date of Publication | Type |
|---|
| Degrees of ambiguity for parity tree automata | 2026-03-23 | Paper |
The Church synthesis problem over continuous time
Logical Methods in Computer Science | 2025-09-25 | Paper |
| On uniformization in the full binary tree | 2024-08-06 | Paper |
A complete axiomatisation for trace congruence of finite state behaviors
Lecture Notes in Computer Science | 2023-04-28 | Paper |
| scientific article; zbMATH DE number 7650347 (Why is no real title available?) | 2023-02-03 | Paper |
From finite automata toward hybrid systems (Extended abstract)
Fundamentals of Computation Theory | 2022-12-09 | Paper |
The Expressive Power of Temporal and First-Order Metric Logics
Fields of Logic and Computation III | 2022-11-09 | Paper |
On nets, algebras and modularity
Lecture Notes in Computer Science | 2022-08-16 | Paper |
| scientific article; zbMATH DE number 7559451 (Why is no real title available?) | 2022-07-18 | Paper |
Boris Abramovich Trakhtenbrot
Russian Mathematical Surveys | 2022-05-09 | Paper |
On degrees of ambiguity for Büchi tree automata
Information and Computation | 2021-11-25 | Paper |
Checking equivalences between concurrent systems of finite agents (extended abstract)
Automata, Languages and Programming | 2019-12-04 | Paper |
Some complexity results for stateful network verification
Formal Methods in System Design | 2019-11-18 | Paper |
| Complementation of finitely ambiguous Büchi automata | 2018-11-22 | Paper |
A proof of Stavi's theorem
(available as arXiv preprint) | 2018-04-25 | Paper |
On compositionality and its limitations
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Interpretations in trees with countably many branches
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
On expressive power of regular expressions over infinite orders
Computer Science – Theory and Applications | 2016-07-25 | Paper |
No future without (\textit{a hint of}) past. A finite basis for `almost future' temporal logic
Information and Computation | 2016-03-10 | Paper |
On almost future temporal logics
Fields of Logic and Computation II | 2015-09-22 | Paper |
The complexity of multi-mean-payoff and multi-energy games
Information and Computation | 2015-05-04 | Paper |
A Proof of Kamp's theorem
Logical Methods in Computer Science | 2014-03-24 | Paper |
An unusual temporal logic
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
The probability nesting game
Electronic Notes in Theoretical Computer Science | 2013-08-15 | Paper |
The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates
Information and Computation | 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
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
| The Church synthesis problem with metric | 2012-09-18 | Paper |
On countable chains having decidable monadic theory
The Journal of Symbolic Logic | 2012-06-19 | Paper |
Temporal logics over linear time domains are in PSPACE
Information and Computation | 2012-05-24 | Paper |
Continuous time temporal logic with counting
Information and Computation | 2012-05-24 | Paper |
Selection over classes of ordinals expanded by monadic predicates
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Expressing cardinality quantifiers in monadic second-order logic over chains
Journal of Symbolic Logic | 2011-06-28 | Paper |
Decidable expansions of labelled linear orderings
Logical Methods in Computer Science | 2011-05-26 | Paper |
Church synthesis problem for noisy input
Foundations of Software Science and Computational Structures | 2011-05-19 | Paper |
The complexity of linear-time temporal logic over the class of ordinals
Logical Methods in Computer Science | 2011-03-08 | Paper |
The full binary tree cannot be interpreted in a chain
Journal of Symbolic Logic | 2011-01-12 | Paper |
Decidable expansions of labelled linear orderings
Lecture Notes in Computer Science | 2010-09-03 | Paper |
Temporal logics over linear time domains are in PSPACE
Lecture Notes in Computer Science | 2010-08-31 | Paper |
Complexity of metric temporal logics with counting and the Pnueli modalities
Theoretical Computer Science | 2010-05-27 | Paper |
On the Borel complexity of MSO definable sets of branches
Fundamenta Informaticae | 2010-05-25 | Paper |
Computing partial information out of intractable: powers of algebraic numbers as an example
Journal of Number Theory | 2010-01-08 | Paper |
Decidable fragments of many-sorted logic
Journal of Symbolic Computation | 2009-12-03 | Paper |
Cardinality Quantifiers in MLO over Trees
Computer Science Logic | 2009-11-12 | Paper |
Decidable Extensions of Church’s Problem
Computer Science Logic | 2009-11-12 | Paper |
Time-Bounded Verification
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
The Church Problem for Countable Ordinals
Logical Methods in Computer Science | 2009-06-30 | Paper |
Selection in the monadic theory of a countable ordinal
Journal of Symbolic Logic | 2009-03-23 | Paper |
Church Synthesis Problem with Parameters
Computer Science Logic | 2009-03-12 | Paper |
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
Computer Science Logic | 2009-03-12 | Paper |
Logical Refinements of Church’s Problem
Computer Science Logic | 2009-03-05 | Paper |
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
Lecture Notes in Computer Science | 2008-12-02 | Paper |
Arity hierarchy for temporal logics
Theoretical Computer Science | 2008-09-16 | Paper |
Decidability and Expressive Power of Real Time Logics
Lecture Notes in Computer Science | 2008-07-08 | Paper |
The Complexity of Temporal Logic with Until and Since over Ordinals
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
Decidable Fragments of Many-Sorted Logic
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
The Church Synthesis Problem with Parameters
Logical Methods in Computer Science | 2008-04-01 | Paper |
Boris A. Trakhtenbrot: Academic Genealogy and Publications
Pillars of Computer Science | 2008-03-25 | Paper |
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
Pillars of Computer Science | 2008-03-25 | Paper |
| Composition theorem for generalized sum | 2007-10-17 | Paper |
Expressiveness of Metric modalities for continuous time
Logical Methods in Computer Science | 2007-10-11 | Paper |
An Expressive Temporal Logic for Real Time
Lecture Notes in Computer Science | 2007-09-05 | Paper |
A logic of reachable patterns in linked data-structures
The Journal of Logic and Algebraic Programming | 2007-08-23 | Paper |
On decidability of monadic logic of order over the naturals extended by monadic predicates
Information and Computation | 2007-07-16 | Paper |
Temporal logics with incommensurable distances are undecidable
Information and Computation | 2007-05-14 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Expressiveness of Metric Modalities for Continuous Time
Computer Science – Theory and Applications | 2007-05-02 | Paper |
A Logic of Probability with Decidable Model Checking
Journal Of Logic And Computation | 2006-12-04 | Paper |
\(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)
Information and Computation | 2006-08-16 | Paper |
Quantitative analysis of probabilistic lossy channel systems
Information and Computation | 2006-06-30 | Paper |
Verification of probabilistic systems with faulty communication
Information and Computation | 2005-11-22 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Timer formulas and decidable metric temporal logic
Information and Computation | 2005-06-13 | Paper |
| scientific article; zbMATH DE number 2112984 (Why is no real title available?) | 2004-11-01 | Paper |
| scientific article; zbMATH DE number 2112987 (Why is no real title available?) | 2004-11-01 | Paper |
Selection and Uniformization in Generalized Product
Logic Journal of the IGPL | 2004-10-21 | Paper |
Future temporal logic needs infinitely many modalities
Information and Computation | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2038771 (Why is no real title available?) | 2004-02-08 | Paper |
Automata over continuous time
Theoretical Computer Science | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1956504 (Why is no real title available?) | 2003-07-30 | Paper |
Counting on CTL\(^*\): On the expressive power of monadic path logic
Information and Computation | 2003-07-29 | Paper |
| scientific article; zbMATH DE number 1948170 (Why is no real title available?) | 2003-07-10 | Paper |
| scientific article; zbMATH DE number 1927553 (Why is no real title available?) | 2003-06-12 | Paper |
Expressive completeness of duration calculus.
Information and Computation | 2003-01-14 | Paper |
An infinite hierarchy of temporal logics over branching time
Information and Computation | 2003-01-14 | Paper |
Decidability of split equivalence
Information and Computation | 2003-01-14 | Paper |
Definability in Rationals with Real Order in the Background
Journal Of Logic And Computation | 2002-11-28 | Paper |
| scientific article; zbMATH DE number 1759449 (Why is no real title available?) | 2002-11-04 | Paper |
| scientific article; zbMATH DE number 1809725 (Why is no real title available?) | 2002-09-30 | Paper |
Finite variability interpretation of monadic logic of order
Theoretical Computer Science | 2002-07-31 | Paper |
Monadic Logic of Order over Naturals has no Finite Base
Journal Of Logic And Computation | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1678384 (Why is no real title available?) | 2001-12-04 | Paper |
Definability and undefinability with real order at the background
Journal of Symbolic Logic | 2001-06-18 | Paper |
| scientific article; zbMATH DE number 1501613 (Why is no real title available?) | 2001-03-05 | Paper |
| scientific article; zbMATH DE number 1424034 (Why is no real title available?) | 2000-09-05 | Paper |
Star free expressions over the reals
Theoretical Computer Science | 2000-08-23 | Paper |
Symbolic model checking for \(\mu\)-calculus requires exponential time
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1405657 (Why is no real title available?) | 2000-07-05 | Paper |
On the decidability of continuous time specification formalisms
Journal Of Logic And Computation | 1999-06-07 | Paper |
| scientific article; zbMATH DE number 1231602 (Why is no real title available?) | 1998-12-21 | Paper |
| scientific article; zbMATH DE number 1222565 (Why is no real title available?) | 1998-11-11 | Paper |
On schematological equivalence of partially interpreted dataflow networks
Information and Computation | 1998-09-27 | Paper |
Modularity and expressibility for nets of relations
Acta Informatica | 1998-08-20 | Paper |
On translations of temporal logic of actions into monadic second-order logic
Theoretical Computer Science | 1998-08-13 | Paper |
Non-elementary lower bound for Propositional Duration Calculus
Information Processing Letters | 1998-08-13 | Paper |
Complexity of equivalence problems for concurrent systems of finite agents
Information and Computation | 1998-07-16 | Paper |
| scientific article; zbMATH DE number 1059328 (Why is no real title available?) | 1997-09-10 | Paper |
On schematological equivalence of dataflow networks
Information and Computation | 1996-07-03 | Paper |
| scientific article; zbMATH DE number 177822 (Why is no real title available?) | 1993-05-18 | Paper |
Connectedness and synchronization
Theoretical Computer Science | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4180816 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4110070 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4119609 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4074506 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4084982 (Why is no real title available?) | 1987-01-01 | Paper |
