| Publication | Date of Publication | Type |
|---|
Verifying linear temporal properties on polyhedral systems: decidability and symbolic algorithms
Information and Computation | 2026-06-23 | Paper |
| From quasi-dominions to progress measures | 2025-02-03 | Paper |
| Reasoning About Data Trees Using CHCs | 2022-12-07 | Paper |
Partial preferences for mediated bargaining
(available as arXiv preprint) | 2021-06-22 | Paper |
| Partial preferences for mediated bargaining | 2021-06-22 | Paper |
Towards efficient exact synthesis for linear hybrid systems
(available as arXiv preprint) | 2021-03-03 | Paper |
| Towards efficient exact synthesis for linear hybrid systems | 2021-03-03 | Paper |
| Quantitative fairness games | 2021-02-16 | Paper |
Tracking smooth trajectories in linear hybrid systems
Information and Computation | 2017-11-16 | Paper |
| Hedging bets in Markov decision processes | 2017-07-19 | Paper |
Reachability games for linear hybrid systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control | 2017-05-16 | Paper |
Tracking differentiable trajectories across polyhedra boundaries
Proceedings of the 16th international conference on Hybrid systems: computation and control | 2017-05-16 | Paper |
Decidability of circumscribed description logics revisited
Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation | 2015-02-04 | Paper |
Code aware resource management
Formal Methods in System Design | 2014-06-30 | Paper |
Model Checking Quantitative Linear Time Logic
Electronic Notes in Theoretical Computer Science | 2014-05-13 | Paper |
Automatic synthesis of switching controllers for linear hybrid systems: safety control
Theoretical Computer Science | 2014-01-10 | Paper |
Automata-theoretic decision of timed games
Theoretical Computer Science | 2013-12-10 | Paper |
Auctions for partial heterogeneous preferences
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Quantitatively fair scheduling
Theoretical Computer Science | 2012-03-13 | Paper |
Exploring the boundary of half-positionality
Annals of Mathematics and Artificial Intelligence | 2012-01-13 | Paper |
| Defeasible inclusions in low-complexity DLs | 2012-01-12 | Paper |
Towards a mechanism for incentivating privacy
Computer Security – ESORICS 2011 | 2011-11-22 | Paper |
Graded alternating-time temporal logic
Fundamenta Informaticae | 2011-03-28 | Paper |
Graded Alternating-Time Temporal Logic
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-01-07 | Paper |
Exploring the boundary of half positionality
Lecture Notes in Computer Science | 2010-08-24 | Paper |
The element of surprise in timed games.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
Balanced Paths in Colored Graphs
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Admissible Strategies in Infinite Games over Graphs
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Qualitative Logics and Equivalences for Probabilistic Systems
Logical Methods in Computer Science | 2009-06-30 | Paper |
An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games
Computer Aided Verification | 2007-11-29 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Frontiers of Combining Systems
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Model checking discounted temporal properties
Theoretical Computer Science | 2005-12-06 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 2086509 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2038773 (Why is no real title available?) | 2004-02-08 | Paper |
