| Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic | 0 | 0.34 | 2021 |
| Modular Descriptions of Regular Functions. | 0 | 0.34 | 2019 |
| Aperiodic Weighted Automata and Weighted First-Order Logic. | 0 | 0.34 | 2019 |
| Non-Sequential Theory of Distributed Systems. | 0 | 0.34 | 2019 |
| Timed Systems through the Lens of Logic | 1 | 0.37 | 2019 |
| Logics for Reversible Regular Languages and Semigroups with Involution. | 0 | 0.34 | 2019 |
| Fast Algorithms For Handling Diagonal Constraints In Timed Automata | 0 | 0.34 | 2019 |
| Modelling Match Outcome in Australian Football: Improved accuracy with large databases. | 0 | 0.34 | 2019 |
| It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". | 0 | 0.34 | 2018 |
| Regular Transducer Expressions for Regular Transformations. | 1 | 0.36 | 2018 |
| A unifying survey on weighted logics and weighted automata - Core weighted logic: minimal and versatile specification of quantitative properties. | 0 | 0.34 | 2018 |
| Gossiping in Message-Passing Systems. | 0 | 0.34 | 2018 |
| Reachability in timed automata with diagonal constraints. | 0 | 0.34 | 2018 |
| Unambiguous Forest Factorization. | 0 | 0.34 | 2018 |
| Communicating Finite-State Machines and Two-Variable Logic. | 0 | 0.34 | 2018 |
| Towards an Efficient Tree Automata based technique for Timed Systems. | 1 | 0.35 | 2017 |
| Analyzing Timed Systems Using Tree Automata. | 2 | 0.37 | 2016 |
| Nested Words for Order-2 Pushdown Systems. | 1 | 0.36 | 2016 |
| Verification of Parameterized Communicating Automata via Split-Width. | 0 | 0.34 | 2016 |
| Checking conformance for time-constrained scenario-based specifications | 0 | 0.34 | 2015 |
| Distributed Timed Automata with Independently Evolving Clocks | 8 | 0.52 | 2014 |
| Parameterized Verification of Communicating Automata under Context Bounds. | 4 | 0.46 | 2014 |
| Logical characterization of weighted pebble walking automata | 3 | 0.39 | 2014 |
| Adding pebbles to weighted automata: Easy specification & efficient evaluation. | 0 | 0.34 | 2014 |
| Verifying Communicating Multi-pushdown Systems via Split-Width. | 1 | 0.35 | 2014 |
| Reasoning About Distributed Systems: WYSIWYG (Invited Talk). | 3 | 0.40 | 2014 |
| Parameterized Communicating Automata: Complementation and Model Checking. | 2 | 0.40 | 2014 |
| Pebble Weighted Automata and Weighted Logics | 2 | 0.37 | 2014 |
| Fair Synthesis for Asynchronous Distributed Systems | 6 | 0.47 | 2013 |
| Event clock message passing automata: a logical characterization and an emptiness checking algorithm | 0 | 0.34 | 2013 |
| Weighted specifications over nested words | 2 | 0.37 | 2013 |
| A probabilistic kleene theorem | 1 | 0.36 | 2012 |
| Adding pebbles to weighted automata | 4 | 0.41 | 2012 |
| MSO decidability of multi-pushdown systems via split-width | 18 | 0.71 | 2012 |
| Model checking languages of data words | 17 | 0.69 | 2012 |
| Decidability of well-connectedness for distributed synthesis | 0 | 0.34 | 2012 |
| Temporal logics for concurrent recursive programs: Satisfiability and model checking. | 8 | 0.53 | 2011 |
| Pebble weighted automata and transitive closure logics | 15 | 0.69 | 2010 |
| CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings | 28 | 1.35 | 2010 |
| Model checking time-constrained scenario-based specifications | 7 | 0.49 | 2010 |
| Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces | 8 | 0.53 | 2010 |
| Weighted versus Probabilistic Logics | 22 | 0.78 | 2009 |
| Distributed synthesis for well-connected architectures | 12 | 0.66 | 2009 |
| Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems | 5 | 0.44 | 2009 |
| A Survey On Small Fragments Of First-Order Logic Over Finite Words | 35 | 1.34 | 2008 |
| On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables | 15 | 1.41 | 2008 |
| Timed substitutions for regular signal-event languages | 2 | 0.40 | 2007 |
| Minimal counterexample generation for SPIN | 12 | 0.56 | 2007 |
| Weighted automata and weighted logics | 123 | 4.11 | 2007 |
| Automata and logics for timed message sequence charts | 10 | 0.51 | 2007 |
