| Publication | Date of Publication | Type |
|---|
| Reinforcement planning for effective -optimal policies in dense time with discontinuities | 2025-07-28 | Paper |
On robustness for the Skolem, positivity and ultimate positivity problems
Logical Methods in Computer Science | 2024-06-27 | Paper |
| On robustness for the Skolem and positivity problems | 2024-04-23 | Paper |
| Resilience of Timed Systems | 2024-02-05 | Paper |
Succinct Population Protocols for Presburger Arithmetic
(available as arXiv preprint) | 2023-02-07 | Paper |
| Classification among Hidden Markov Models | 2023-02-03 | Paper |
| Global PAC bounds for learning discrete time Markov chains | 2021-02-09 | Paper |
Distribution-based objectives for Markov decision processes
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
| Timed negotiations | 2020-09-23 | Paper |
Controlling a population
(available as arXiv preprint) | 2020-05-27 | Paper |
A look-ahead simulation algorithm for DBN models of biochemical pathways
Hybrid Systems Biology | 2019-12-04 | Paper |
A look-ahead simulation algorithm for DBN models of biochemical pathways
Hybrid Systems Biology | 2019-12-04 | Paper |
Controlling a population
(available as arXiv preprint) | 2019-08-06 | Paper |
| Symbolically quantifying response time in stochastic models using moments and semirings | 2018-07-17 | Paper |
Qualitative determinacy and decidability of stochastic games with signals
Journal of the ACM | 2018-05-17 | Paper |
| On regularity of unary probabilistic automata | 2018-01-24 | Paper |
Approximate verification of the symbolic dynamics of Markov chains
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
| scientific article; zbMATH DE number 6687767 (Why is no real title available?) | 2017-02-21 | Paper |
Decidable classes of unbounded Petri nets with time and urgency
Application and Theory of Petri Nets and Concurrency | 2016-10-04 | Paper |
Knowledge = observation + memory + computation
Lecture Notes in Computer Science | 2015-10-01 | Paper |
Approximate verification of the symbolic dynamics of Markov chains
Journal of the ACM | 2015-08-14 | Paper |
Diagnosis from scenarios
Discrete Event Dynamic Systems | 2014-12-12 | Paper |
Privacy preserving minimal observability for composite transactional services
Discrete Event Dynamic Systems | 2014-12-12 | Paper |
Asynchronous Games over Tree Architectures
Automata, Languages, and Programming | 2013-08-07 | Paper |
Symbolically Bounding the Drift in Time-Constrained MSC Graphs
Theoretical Aspects of Computing – ICTAC 2012 | 2012-09-21 | Paper |
| Minimal disclosure in partially observable Markov decision processes | 2012-08-31 | Paper |
| Verifying recursive active documents with positive data tree rewriting | 2012-08-29 | Paper |
Regular set of representatives for time-constrained MSC graphs
Information Processing Letters | 2012-07-25 | Paper |
Quasi-static scheduling of communicating tasks
Information and Computation | 2010-10-07 | Paper |
Optimal Zielonka-type construction of deterministic asynchronous automata
Automata, Languages and Programming | 2010-09-07 | Paper |
QUANTIFYING THE DISCORD: ORDER DISCREPANCIES IN MESSAGE SEQUENCE CHARTS
International Journal of Foundations of Computer Science | 2010-04-22 | Paper |
High-level message sequence charts and projections.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
On commutativity based edge lean search
Annals of Mathematics and Artificial Intelligence | 2010-03-15 | Paper |
Causal message sequence charts
Theoretical Computer Science | 2009-09-29 | Paper |
Grey-Box Checking
Lecture Notes in Computer Science | 2009-03-11 | Paper |
Quasi-Static Scheduling of Communicating Tasks
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Tree Pattern Rewriting Systems
Automated Technology for Verification and Analysis | 2008-11-20 | Paper |
Causal Message Sequence Charts
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
Quantifying the Discord: Order Discrepancies in Message Sequence Charts
Automated Technology for Verification and Analysis | 2008-07-03 | Paper |
| scientific article; zbMATH DE number 5286864 (Why is no real title available?) | 2008-06-11 | Paper |
Pattern matching and membership for hierarchical message sequence charts
Theory of Computing Systems | 2008-06-06 | Paper |
Products of Message Sequence Charts
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
| On communicating automata with bounded channels | 2008-01-02 | Paper |
On Commutativity Based Edge Lean Search
Automata, Languages and Programming | 2007-11-28 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Constructing Exponential-Size Deterministic Zielonka Automata
Automata, Languages and Programming | 2007-09-11 | Paper |
Detecting Races in Ensembles of Message Sequence Charts
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
CONCUR 2005 – Concurrency Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation | 2006-07-12 | Paper |
Infinite-state high-level MSCs: model-checking and realizability
Journal of Computer and System Sciences | 2006-06-30 | Paper |
Lectures on Concurrency and Petri Nets
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
| scientific article; zbMATH DE number 2086239 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086660 (Why is no real title available?) | 2004-08-11 | Paper |
