| Publication | Date of Publication | Type |
|---|
| Reachability in distributed memory automata | 2026-03-23 | Paper |
On the satisfiability of local first-order logics with data
Logical Methods in Computer Science | 2024-09-04 | Paper |
Round- and context-bounded control of dynamic pushdown systems
Formal Methods in System Design | 2024-06-28 | Paper |
Analyzing robustness of Angluin's \(L^*\) algorithm in presence of noise
Logical Methods in Computer Science | 2024-06-27 | Paper |
Branch-well-structured transition systems and extensions
Logical Methods in Computer Science | 2024-06-27 | Paper |
On the existential fragments of local first-order logics with data
(available as arXiv preprint) | 2024-02-08 | Paper |
| On the existential fragments of local first-order logics with data | 2024-02-08 | Paper |
Analyzing robustness of Angluin's \(\mathrm{L}^\ast\) algorithm in presence of noise
(available as arXiv preprint) | 2024-02-08 | Paper |
| Analyzing robustness of Angluin's \(\mathrm{L}^\ast\) algorithm in presence of noise | 2024-02-08 | Paper |
| scientific article; zbMATH DE number 7799617 (Why is no real title available?) | 2024-02-05 | Paper |
| scientific article; zbMATH DE number 7730616 (Why is no real title available?) | 2023-08-21 | Paper |
Round-bounded control of parameterized systems
Automated Technology for Verification and Analysis | 2023-07-28 | Paper |
A survey of model learning techniques for recurrent neural networks
Lecture Notes in Computer Science | 2023-07-26 | Paper |
Synthesis in presence of dynamic links
Information and Computation | 2022-12-08 | Paper |
Branch-well-structured transition systems and extensions
(available as arXiv preprint) | 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 |
scientific article; zbMATH DE number 7471708 (Why is no real title available?)
(available as arXiv preprint) | 2022-02-09 | Paper |
| scientific article; zbMATH DE number 7471708 (Why is no real title available?) | 2022-02-09 | Paper |
| scientific article; zbMATH DE number 7455739 (Why is no real title available?) | 2022-01-11 | Paper |
scientific article; zbMATH DE number 7455739 (Why is no real title available?)
(available as arXiv preprint) | 2022-01-11 | Paper |
It is easy to be wise after the event: communicating finite-state machines capture first-order logic with ``happened before
(available as arXiv preprint) | 2021-08-04 | Paper |
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
Journal of Computer and System Sciences | 2020-10-23 | Paper |
Parameterized synthesis for fragments of first-order logic over data words
(available as arXiv preprint) | 2020-09-23 | Paper |
Communicating finite-state machines and two-variable logic
(available as arXiv preprint) | 2020-08-05 | Paper |
| The complexity of flat freeze LTL | 2020-05-27 | Paper |
Identifiers in registers. Describing network algorithms with logic
(available as arXiv preprint) | 2020-01-28 | Paper |
The complexity of flat freeze LTL
(available as arXiv preprint) | 2019-11-26 | Paper |
Realizability of concurrent recursive programs
Formal Methods in System Design | 2018-11-15 | Paper |
Emptiness of ordered multi-pushdown automata is 2ETIME-complete
International Journal of Foundations of Computer Science | 2018-05-14 | Paper |
Logic for communicating automata with parameterized topology
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 |
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 |
One-counter automata with counter observability
(available as arXiv preprint) | 2018-04-19 | Paper |
An automata-theoretic approach to the verification of distributed algorithms
Information and Computation | 2018-03-21 | Paper |
An automata-theoretic approach to the verification of distributed algorithms
Information and Computation | 2018-03-21 | Paper |
| An automata-theoretic approach to the verification of distributed algorithms | 2017-09-12 | Paper |
The complexity of model checking multi-stack systems
Theory of Computing Systems | 2017-08-15 | Paper |
The Complexity of Model Checking Multi-stack Systems
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
| Parameterized communicating automata: complementation and model checking | 2017-04-25 | Paper |
Parameterized Verification of Communicating Automata under Context Bounds
Lecture Notes in Computer Science | 2015-10-28 | Paper |
Automata and Logics for Concurrent Systems: Five Models in Five Pages
Implementation and Application of Automata | 2015-09-23 | Paper |
A robust class of data languages and an application to learning
Logical Methods in Computer Science | 2015-01-15 | Paper |
Temporal logics for concurrent recursive programs: satisfiability and model checking
Journal of Applied Logic | 2014-11-20 | 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 |
A fresh approach to learning register automata
Developments in Language Theory | 2013-06-28 | Paper |
Weighted specifications over nested words
Lecture Notes in Computer Science | 2013-03-18 | Paper |
Dynamic communicating automata and branching high-level MSCs
Language and Automata Theory and Applications | 2013-03-18 | Paper |
A probabilistic Kleene theorem
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Model checking languages of data words
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
An optimal construction of Hanf sentences
Journal of Applied Logic | 2012-05-23 | Paper |
An automaton over data words that captures EMSO logic
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Propositional dynamic logic for message-passing systems
Logical Methods in Computer Science | 2010-09-21 | Paper |
Pebble weighted automata and transitive closure logics
Automata, Languages and Programming | 2010-09-07 | Paper |
Realizability of Dynamic MSC Languages
Computer Science – Theory and Applications | 2010-06-22 | Paper |
Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Validation of Stochastic Systems
Lecture Notes in Computer Science | 2009-07-24 | Paper |
Weighted versus Probabilistic Logics
Developments in Language Theory | 2009-07-07 | Paper |
On the Expressive Power of 2-Stack Visibly Pushdown Automata
Logical Methods in Computer Science | 2009-04-29 | Paper |
Realizability of Concurrent Recursive Programs
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Distributed Timed Automata with Independently Evolving Clocks
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
Developments in Language Theory | 2008-10-30 | Paper |
Muller message-passing automata and logics
Information and Computation | 2008-10-08 | Paper |
Automata and Logics for Timed Message Sequence Charts
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Propositional Dynamic Logic for Message-Passing Systems
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Weighted Distributed Systems and Their Logics
Logical Foundations of Computer Science | 2008-01-04 | Paper |
Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
| Formal Models of Communicating Systems | 2006-10-27 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Message-passing automata are expressively equivalent to EMSO logic
Theoretical Computer Science | 2006-09-13 | Paper |
Formal Techniques for Networked and Distributed Systems - FORTE 2005
Lecture Notes in Computer Science | 2006-07-07 | Paper |
CONCUR 2004 - Concurrency Theory
Lecture Notes in Computer Science | 2005-08-23 | Paper |
| scientific article; zbMATH DE number 2163041 (Why is no real title available?) | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2087422 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1980918 (Why is no real title available?) | 2003-09-15 | Paper |
| scientific article; zbMATH DE number 1705169 (Why is no real title available?) | 2002-03-03 | Paper |
