| Publication | Date of Publication | Type |
|---|
Long-run satisfaction of path properties
| 2024-12-19 | Paper |
Semilinear representations for series-parallel atomic congestion games
| 2024-09-12 | Paper |
Parameterized safety verification of round-based shared-memory systems
| 2024-06-24 | Paper |
The variance-penalized stochastic shortest path problem
| 2024-06-24 | Paper |
Timed automata verification and synthesis via finite automata learning
| 2024-04-05 | Paper |
Abstraction refinement algorithms for timed automata
Computer Aided Verification | 2024-02-16 | Paper |
Robust controller synthesis in timed Büchi automata: a symbolic approach
Computer Aided Verification | 2024-02-16 | Paper |
Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking
| 2023-08-21 | Paper |
Repairing real-time requirements
Automated Technology for Verification and Analysis | 2023-06-02 | Paper |
Zone-based verification of timed automata: extrapolations, simulations and what next?
| 2023-01-18 | Paper |
Non-blind strategies in timed network congestion games
| 2023-01-18 | Paper |
Complexity of planning for connected agents in a partially known environment
Theoretical Computer Science | 2023-01-04 | Paper |
Incremental methods for checking real-time consistency
| 2021-03-02 | Paper |
Stochastic shortest paths and weight-bounded properties in Markov decision processes
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
An abstraction technique for parameterized model checking of leader election protocols: application to FTSP
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
Admissiblity in concurrent games
| 2020-05-27 | Paper |
Admissible strategies in timed games
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Symbolic quantitative robustness analysis of timed automata
| 2019-09-17 | Paper |
scientific article; zbMATH DE number 6862070 (Why is no real title available?)
| 2018-04-19 | Paper |
Percentile queries in multi-dimensional Markov decision processes
Computer Aided Verification | 2018-03-01 | Paper |
Assume-admissible synthesis
| 2017-09-12 | Paper |
Percentile queries in multi-dimensional Markov decision processes
Formal Methods in System Design | 2017-05-15 | Paper |
Multiple-environment Markov decision processes
| 2017-04-25 | Paper |
Assume-admissible synthesis
Acta Informatica | 2017-04-03 | Paper |
Non-zero sum games for reactive synthesis
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Variations on the stochastic shortest path problem
Lecture Notes in Computer Science | 2015-02-04 | Paper |
Robust reachability in timed automata and games: a game-based approach
Theoretical Computer Science | 2014-12-12 | Paper |
Probabilistic robust timed games
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Robustness in timed automata
Lecture Notes in Computer Science | 2014-07-07 | Paper |
Shrinking timed automata
Information and Computation | 2014-02-11 | Paper |
Robust weighted timed automata and games
Lecture Notes in Computer Science | 2013-08-16 | Paper |
Robust Controller Synthesis in Timed Automata
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
Robust reachability in timed automata: a game-based approach
Automata, Languages, and Programming | 2012-11-01 | Paper |
A comparison of succinctly represented finite-state systems
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Shrinking timed automata
| 2012-08-31 | Paper |
Online correlation clustering
| 2012-01-23 | Paper |
Robust model-checking of timed automata via pumping in channel machines
Lecture Notes in Computer Science | 2011-10-07 | Paper |
Timed Automata Can Always Be Made Implementable
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Untimed Language Preservation in Timed Systems
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
