| Publication | Date of Publication | Type |
|---|
| On the satisfiability of local first-order logics with data | 2024-09-04 | Paper |
| Round- and context-bounded control of dynamic pushdown systems | 2024-06-28 | Paper |
| Analyzing robustness of Angluin's \(L^*\) algorithm in presence of noise | 2024-06-27 | Paper |
| Branch-well-structured transition systems and extensions | 2024-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6191001 | 2024-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6191009 | 2024-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187056 | 2024-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6134258 | 2023-08-21 | Paper |
| Round-bounded control of parameterized systems | 2023-07-28 | Paper |
| A survey of model learning techniques for recurrent neural networks | 2023-07-26 | Paper |
| Synthesis in presence of dynamic links | 2022-12-08 | Paper |
| Branch-well-structured transition systems and extensions | 2022-08-19 | Paper |
| Non axiomatisability of positive relation algebras with constants, via graph homomorphisms | 2022-07-18 | Paper |
| Property-directed verification and robustness certification of recurrent neural networks | 2022-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028474 | 2022-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5020999 | 2022-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009419 | 2021-08-04 | Paper |
| Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic | 2020-10-23 | Paper |
| Parameterized synthesis for fragments of first-order logic over data words | 2020-09-23 | Paper |
| Communicating Finite-State Machines and Two-Variable Logic | 2020-08-05 | Paper |
| The Complexity of Flat Freeze LTL | 2020-05-27 | Paper |
| Identifiers in registers. Describing network algorithms with logic | 2020-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4972731 | 2019-11-26 | Paper |
| Realizability of concurrent recursive programs | 2018-11-15 | Paper |
| Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete | 2018-05-14 | Paper |
| Logic for communicating automata with parameterized topology | 2018-04-23 | Paper |
| Logical characterization of weighted pebble walking automata | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636567 | 2018-04-19 | Paper |
| An automata-theoretic approach to the verification of distributed algorithms | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5357714 | 2017-09-12 | Paper |
| The complexity of model checking multi-stack systems | 2017-08-15 | Paper |
| The Complexity of Model Checking Multi-stack Systems | 2017-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2978552 | 2017-04-25 | Paper |
| Parameterized Verification of Communicating Automata under Context Bounds | 2015-10-28 | Paper |
| Automata and Logics for Concurrent Systems: Five Models in Five Pages | 2015-09-23 | Paper |
| A Robust Class of Data Languages and an Application to Learning | 2015-01-15 | Paper |
| Temporal logics for concurrent recursive programs: satisfiability and model checking | 2014-11-20 | 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 |
| A Fresh Approach to Learning Register Automata | 2013-06-28 | Paper |
| Weighted Specifications over Nested Words | 2013-03-18 | Paper |
| Dynamic Communicating Automata and Branching High-Level MSCs | 2013-03-18 | Paper |
| A Probabilistic Kleene Theorem | 2012-11-21 | Paper |
| Model Checking Languages of Data Words | 2012-06-22 | Paper |
| An optimal construction of Hanf sentences | 2012-05-23 | Paper |
| An Automaton over Data Words That Captures EMSO Logic | 2011-09-02 | Paper |
| Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking | 2011-08-17 | Paper |
| Propositional dynamic logic for message-passing systems | 2010-09-21 | Paper |
| Pebble Weighted Automata and Transitive Closure Logics | 2010-09-07 | Paper |
| Realizability of Dynamic MSC Languages | 2010-06-22 | Paper |
| Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation | 2009-08-11 | Paper |
| Validation of Stochastic Systems | 2009-07-24 | Paper |
| Weighted versus Probabilistic Logics | 2009-07-07 | Paper |
| On the Expressive Power of 2-Stack Visibly Pushdown Automata | 2009-04-29 | Paper |
| Realizability of Concurrent Recursive Programs | 2009-03-31 | Paper |
| Distributed Timed Automata with Independently Evolving Clocks | 2008-11-25 | Paper |
| Emptiness of Multi-pushdown Automata Is 2ETIME-Complete | 2008-10-30 | Paper |
| Muller message-passing automata and logics | 2008-10-08 | Paper |
| Automata and Logics for Timed Message Sequence Charts | 2008-04-24 | Paper |
| Propositional Dynamic Logic for Message-Passing Systems | 2008-04-24 | Paper |
| Weighted Distributed Systems and Their Logics | 2008-01-04 | Paper |
| Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning | 2007-09-03 | Paper |
| Formal Models of Communicating Systems | 2006-10-27 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Message-passing automata are expressively equivalent to EMSO logic | 2006-09-13 | Paper |
| Formal Techniques for Networked and Distributed Systems - FORTE 2005 | 2006-07-07 | Paper |
| CONCUR 2004 - Concurrency Theory | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673428 | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738217 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428292 | 2003-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2771064 | 2002-03-03 | Paper |
