| Publication | Date of Publication | Type |
|---|
Timed systems through the lens of logic
| 2024-12-19 | Paper |
Efficient construction of reversible transducers from regular transducer expressions
| 2024-12-06 | Paper |
Simulations for event-clock automata
Logical Methods in Computer Science | 2024-09-04 | Paper |
Simulations for event-clock automata
| 2024-08-13 | Paper |
CONCUR test-of-time award 2022 (invited paper)
| 2024-08-13 | Paper |
Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
| 2024-08-13 | Paper |
Fast algorithms for handling diagonal constraints in timed automata
Computer Aided Verification | 2024-02-16 | Paper |
A unified model for real-time systems: symbolic techniques and implementation
| 2024-02-01 | Paper |
Asynchronous cellular automata for pomsets without auto-concurrency
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
Zone-based verification of timed automata: extrapolations, simulations and what next?
| 2023-01-18 | Paper |
Removing \(\epsilon \)-transitions in timed automata
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Revisiting underapproximate reachability for multipushdown systems
Tools and Algorithms for the Construction and Analysis of Systems | 2022-10-13 | Paper |
Poset properties of complex traces
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
scientific article; zbMATH DE number 7566078 (Why is no real title available?)
| 2022-08-02 | Paper |
scientific article; zbMATH DE number 7561720 (Why is no real title available?)
| 2022-07-21 | Paper |
Register Transducers Are Marble Transducers
| 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559475 (Why is no real title available?)
| 2022-07-18 | Paper |
Weighted automata and weighted logics
Monographs in Theoretical Computer Science. An EATCS Series | 2022-04-28 | Paper |
Fast zone-based algorithms for reachability in pushdown timed automata
| 2022-03-25 | Paper |
Regular transducer expressions for regular transformations
Information and Computation | 2022-01-06 | Paper |
It is easy to be wise after the event: communicating finite-state machines capture first-order logic with ``happened before
| 2021-08-04 | Paper |
Reachability in timed automata with diagonal constraints
| 2021-08-04 | Paper |
Regular transducer expressions for regular transformations
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
Journal of Computer and System Sciences | 2020-10-23 | Paper |
Communicating finite-state machines and two-variable logic
| 2020-08-05 | Paper |
scientific article; zbMATH DE number 7222494 (Why is no real title available?)
| 2020-07-19 | Paper |
Towards an Efficient Tree Automata based technique for Timed Systems
| 2020-05-27 | Paper |
Modular descriptions of regular functions
| 2020-04-29 | Paper |
Asynchronous cellular automata for infinite traces
Automata, Languages and Programming | 2019-12-04 | Paper |
A domain for concurrent termination a generalization of Mazurkiewicz traces (extended abstract)
Automata, Languages and Programming | 2019-01-10 | Paper |
A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
Soft Computing | 2018-10-22 | Paper |
On recognizable and rational formal power series in partially commuting variables
Automata, Languages and Programming | 2018-07-04 | Paper |
Analyzing timed systems using tree automata
| 2018-05-30 | Paper |
Logical characterization of weighted pebble walking automata
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
An automata-theoretic approach to the verification of distributed algorithms
Information and Computation | 2018-03-21 | Paper |
Analyzing Timed Systems Using Tree Automata
| 2018-03-21 | Paper |
On the power of non-observable actions in timed automata
STACS 96 | 2017-11-16 | Paper |
An automata-theoretic approach to the verification of distributed algorithms
| 2017-09-12 | Paper |
Parameterized communicating automata: complementation and model checking
| 2017-04-25 | Paper |
Verification of parameterized communicating automata via split-width
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Verifying communicating multi-pushdown systems via split-width
Automated Technology for Verification and Analysis | 2015-12-17 | Paper |
Parameterized Verification of Communicating Automata under Context Bounds
Lecture Notes in Computer Science | 2015-10-28 | Paper |
Fair synthesis for asynchronous distributed systems
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Checking conformance for time-constrained scenario-based specifications
Theoretical Computer Science | 2015-07-24 | Paper |
Temporal logics for concurrent recursive programs: satisfiability and model checking
Journal of Applied Logic | 2014-11-20 | Paper |
Controllers for the verification of communicating multi-pushdown systems
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Pebble weighted automata and weighted logics
ACM Transactions on Computational Logic | 2014-07-17 | Paper |
Event clock message passing automata: a logical characterization and an emptiness checking algorithm
Formal Methods in System Design | 2014-06-30 | Paper |
Distributed timed automata with independently evolving clocks
Fundamenta Informaticae | 2014-05-14 | Paper |
Adding pebbles to weighted automata: easy specification \& efficient evaluation
Theoretical Computer Science | 2014-04-29 | Paper |
Decidability of well-connectedness for distributed synthesis
Information Processing Letters | 2013-03-21 | Paper |
Weighted specifications over nested words
Lecture Notes in Computer Science | 2013-03-18 | Paper |
Specification and verification using temporal logics
Modern Applications of Automata Theory | 2013-02-26 | Paper |
A probabilistic Kleene theorem
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
MSO decidability of multi-pushdown systems via split-width
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Adding pebbles to weighted automata
Implementation and Application of Automata | 2012-09-20 | Paper |
Model checking time-constrained scenario-based specifications
| 2012-08-29 | Paper |
Model checking languages of data words
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Local temporal logic is expressively complete for cograph dependence alphabets
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
First-order definable languages
| 2011-03-30 | Paper |
Pebble weighted automata and transitive closure logics
Automata, Languages and Programming | 2010-09-07 | Paper |
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
Information and Computation | 2010-08-18 | Paper |
On congruences and partial orders
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Satisfiability and model checking for MSO-definable temporal logics are in PSPACE.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
Distributed synthesis for well-connected architectures
Formal Methods in System Design | 2009-09-25 | Paper |
scientific article; zbMATH DE number 5587270 (Why is no real title available?)
| 2009-07-27 | Paper |
Local safety and local liveness for distributed systems
| 2009-07-27 | Paper |
Weighted versus Probabilistic Logics
Developments in Language Theory | 2009-07-07 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Distributed Timed Automata with Independently Evolving Clocks
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
International Journal of Foundations of Computer Science | 2008-11-24 | Paper |
A Fresh Look at Testing for Asynchronous Communication
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
Intersection of Regular Signal-Event (Timed) Languages
Lecture Notes in Computer Science | 2008-07-08 | Paper |
Refinements and Abstractions of Signal-Event (Timed) Languages
Lecture Notes in Computer Science | 2008-07-08 | Paper |
scientific article; zbMATH DE number 5286865 (Why is no real title available?)
| 2008-06-11 | Paper |
On aperiodic and star-free formal power series in partially commuting variables
Theory of Computing Systems | 2008-06-06 | Paper |
Automata and Logics for Timed Message Sequence Charts
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Distributed Synthesis for Well-Connected Architectures
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Local Testing of Message Sequence Charts Is Difficult
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces
| 2008-01-02 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Timed substitutions for regular signal-event languages
Formal Methods in System Design | 2007-10-11 | Paper |
Model Checking Software
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Weighted automata and weighted logics
Theoretical Computer Science | 2007-07-16 | Paper |
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Information and Computation | 2007-01-22 | Paper |
CONCUR 2005 – Concurrency Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
scientific article; zbMATH DE number 5051547 (Why is no real title available?)
| 2006-09-06 | Paper |
From local to global temporal logics over Mazurkiewicz traces.
Theoretical Computer Science | 2006-05-18 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Local temporal logic is expressively complete for cograph dependence alphabets
Information and Computation | 2005-02-22 | Paper |
scientific article; zbMATH DE number 2086684 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2087486 (Why is no real title available?)
| 2004-08-11 | Paper |
A simple process algebra based on atomic actions with resources
Mathematical Structures in Computer Science | 2004-05-27 | Paper |
The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1796123 (Why is no real title available?)
| 2002-09-04 | Paper |
LTL is expressively complete for Mazurkiewicz traces
Journal of Computer and System Sciences | 2002-08-04 | Paper |
A truly concurrent semantics for a process algebra using resource pomsets
Theoretical Computer Science | 2002-07-15 | Paper |
Resource traces: A domain for processes sharing exclusive resources.
Theoretical Computer Science | 2002-07-15 | Paper |
scientific article; zbMATH DE number 1744968 (Why is no real title available?)
| 2002-05-23 | Paper |
scientific article; zbMATH DE number 1693431 (Why is no real title available?)
| 2002-01-22 | Paper |
scientific article; zbMATH DE number 1670825 (Why is no real title available?)
| 2001-11-11 | Paper |
Asynchronous cellular automata for pomsets
Theoretical Computer Science | 2000-10-26 | Paper |
scientific article; zbMATH DE number 1504580 (Why is no real title available?)
| 2000-09-12 | Paper |
scientific article; zbMATH DE number 1424035 (Why is no real title available?)
| 2000-08-23 | Paper |
scientific article; zbMATH DE number 1424057 (Why is no real title available?)
| 2000-03-23 | Paper |
scientific article; zbMATH DE number 1337733 (Why is no real title available?)
| 1999-09-16 | Paper |
scientific article; zbMATH DE number 1222573 (Why is no real title available?)
| 1999-06-21 | Paper |
Approximating traces
Acta Informatica | 1999-01-11 | Paper |
Rational and recognizable complex trace languages
Information and Computation | 1995-04-10 | Paper |
An extension of Kleene's and Ochmański's theorems to infinite traces
Theoretical Computer Science | 1994-04-05 | Paper |
The poset of infinitary traces
Theoretical Computer Science | 1993-12-20 | Paper |
scientific article; zbMATH DE number 176496 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 176133 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 176739 (Why is no real title available?)
| 1993-05-18 | Paper |
Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
Information Processing Letters | 1993-01-17 | Paper |
Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
Theoretical Computer Science | 1990-01-01 | Paper |
