| Publication | Date of Publication | Type |
|---|
| Timed systems through the lens of logic | 2024-12-19 | Paper |
Tractable representations for Boolean functional synthesis
Annals of Mathematics and Artificial Intelligence | 2024-10-31 | Paper |
Simulations for event-clock automata
Logical Methods in Computer Science | 2024-09-04 | Paper |
| Simulations for event-clock automata | 2024-08-13 | Paper |
| On synthesizing computable Skolem functions for first-order logic | 2024-08-06 | 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 |
| A unified model for real-time systems: symbolic techniques and implementation | 2024-02-01 | Paper |
| Counterexample guided knowledge compilation for Boolean functional synthesis | 2024-02-01 | Paper |
| MDPs as distribution transformers: affine invariant synthesis for safety objectives | 2024-02-01 | Paper |
What's hard about Boolean functional synthesis?
Computer Aided Verification | 2023-05-26 | Paper |
| Near-Optimal Complexity Bounds for Fragments of the Skolem Problem | 2023-02-07 | Paper |
| Classification among Hidden Markov Models | 2023-02-03 | Paper |
On eventual non-negativity and positivity for the weighted sum of powers of matrices
(available as arXiv preprint) | 2022-12-07 | Paper |
Revisiting underapproximate reachability for multipushdown systems
Tools and Algorithms for the Construction and Analysis of Systems | 2022-10-13 | Paper |
Fast zone-based algorithms for reachability in pushdown timed automata
(available as arXiv preprint) | 2022-03-25 | Paper |
Boolean functional synthesis: hardness and practical algorithms
Formal Methods in System Design | 2021-08-30 | Paper |
Sparse Hashing for Scalable Approximate Model Counting
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | 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 |
Towards Parallel Boolean Functional Synthesis
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
Towards an Efficient Tree Automata based technique for Timed Systems
(available as arXiv preprint) | 2020-05-27 | Paper |
On Petri nets with hierarchical special arcs
(available as arXiv preprint) | 2020-05-27 | Paper |
| Complexity of Restricted Variants of Skolem and Related Problems | 2020-05-26 | Paper |
Combining free choice and time in Petri nets
Journal of Logical and Algebraic Methods in Programming | 2020-01-31 | Paper |
Continuous reachability for unordered data Petri nets is in PTime
(available as arXiv preprint) | 2020-01-28 | Paper |
Analyzing timed systems using tree automata
(available as arXiv preprint) | 2018-05-30 | Paper |
Stochastic timed games revisited
(available as arXiv preprint) | 2018-03-21 | Paper |
| Analyzing Timed Systems Using Tree Automata | 2018-03-21 | 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 |
Robustness of time Petri nets under guard enlargement
Fundamenta Informaticae | 2017-03-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 |
Approximate verification of the symbolic dynamics of Markov chains
Journal of the ACM | 2015-08-14 | Paper |
Checking conformance for time-constrained scenario-based specifications
Theoretical Computer Science | 2015-07-24 | Paper |
Reachability problems for Markov chains
Information Processing Letters | 2014-12-09 | 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 |
Robustness of time Petri nets under guard enlargement
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Robustness of time Petri nets under architectural constraints
Lecture Notes in Computer Science | 2012-11-21 | Paper |
Symbolically Bounding the Drift in Time-Constrained MSC Graphs
Theoretical Aspects of Computing – ICTAC 2012 | 2012-09-21 | Paper |
| Model checking time-constrained scenario-based specifications | 2012-08-29 | Paper |
Regular set of representatives for time-constrained MSC graphs
Information Processing Letters | 2012-07-25 | Paper |
Distributed Timed Automata with Independently Evolving Clocks
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Checking Coverage for Infinite Collections of Timed Scenarios
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
Automata and Logics for Timed Message Sequence Charts
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
