| Publication | Date of Publication | Type |
|---|
| Synthesis of hybrid automata with affine dynamics from time-series data | 2024-02-21 | Paper |
| Membership-based synthesis of linear hybrid automata | 2024-02-16 | Paper |
| Run-time optimization for learned controllers through quantitative games | 2024-02-16 | Paper |
| Quantitative safety and liveness | 2023-11-24 | Paper |
| History-deterministic timed automata are not determinizable | 2023-07-21 | Paper |
| A space-efficient on-the-fly algorithm for real-time model checking | 2023-06-28 | Paper |
| State equivalences for rectangular hybrid automata | 2023-06-28 | Paper |
| Synthesis of parametric hybrid automata from time series | 2023-06-02 | Paper |
| Reachable set over-approximation for nonlinear systems using piecewise barrier tubes | 2023-05-26 | Paper |
| Space-time interpolants | 2023-05-26 | Paper |
| Modularity for timed and hybrid systems | 2023-05-17 | Paper |
| Fair simulation | 2023-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874206 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875381 | 2023-02-03 | Paper |
| Long-Run Average Behavior of Vector Addition Systems with States | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092369 | 2022-07-21 | Paper |
| A Survey of Bidding Games on Graphs (Invited Paper) | 2022-07-18 | Paper |
| Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States | 2022-07-18 | Paper |
| Flavors of sequential information flow | 2022-07-08 | Paper |
| How Many Bits Does it Take to Quantize Your Neural Network? | 2021-11-10 | Paper |
| Long lived transients in gene regulation | 2021-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009435 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986503 | 2021-04-27 | Paper |
| Bidding mechanisms in graph games | 2021-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5856414 | 2021-03-26 | Paper |
| Refinement for structured concurrent programs | 2021-02-04 | Paper |
| A Theory of Register Monitors | 2021-01-20 | Paper |
| Counterexample-Guided Refinement of Template Polyhedra | 2020-08-05 | Paper |
| Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults | 2020-08-05 | Paper |
| Infinite-duration poorman-bidding games | 2020-06-18 | Paper |
| Bidirectional nested weighted automata | 2020-05-27 | Paper |
| Infinite-Duration Bidding Games | 2020-05-27 | Paper |
| The Cost of Exactness in Quantitative Reachability | 2020-02-24 | Paper |
| Infinite-duration Bidding Games | 2020-02-11 | Paper |
| Dynamic resource allocation games | 2020-01-22 | Paper |
| What good are digital clocks? | 2019-12-04 | Paper |
| Bidding games on Markov decision processes | 2019-10-22 | Paper |
| Transient memory in gene regulation | 2019-10-10 | Paper |
| Model Checking Gene Regulatory Networks | 2019-09-17 | Paper |
| Faster statistical model checking for unbounded temporal properties | 2019-09-17 | Paper |
| Quantitative Automata under Probabilistic Semantics | 2019-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633826 | 2019-05-06 | Paper |
| Array Folds Logic | 2019-05-03 | Paper |
| Hybrid automata with finite bisimulations | 2019-01-10 | Paper |
| The expressive power of clocks | 2019-01-10 | Paper |
| Monitoring temporal logic with clock variables | 2018-12-06 | Paper |
| Quantitative monitor automata | 2018-08-27 | Paper |
| Introduction to Model Checking | 2018-07-20 | Paper |
| Discrete-time control for rectangular hybrid automata | 2018-07-04 | Paper |
| Nested Weighted Automata | 2018-04-23 | Paper |
| The Target Discounted-Sum Problem | 2018-04-23 | Paper |
| Quantitative Automata under Probabilistic Semantics | 2018-04-23 | Paper |
| Nested Weighted Automata | 2018-03-22 | Paper |
| Nested Weighted Limit-Average Automata of Bounded Width | 2018-03-21 | Paper |
| Local linearizability for concurrent container-type data structures | 2018-03-21 | Paper |
| Linear Distances between Markov Chains | 2018-03-21 | Paper |
| From non-preemptive to preemptive scheduling using synchronization synthesis | 2018-03-01 | Paper |
| Conic abstractions for hybrid systems | 2017-12-01 | Paper |
| Model checking the evolution of gene regulatory networks | 2017-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5367062 | 2017-10-12 | Paper |
| Faster statistical model checking for unbounded temporal properties | 2017-07-13 | Paper |
| A classification of symbolic transition systems | 2017-07-12 | Paper |
| Scalable Static Hybridization Methods for Analysis of Nonlinear Systems | 2017-05-19 | Paper |
| Model measuring for hybrid systems | 2017-05-16 | Paper |
| From non-preemptive to preemptive scheduling using synchronization synthesis | 2017-05-15 | Paper |
| Quantitative fair simulation games | 2017-05-12 | Paper |
| Lipschitz Robustness of Finite-state Transducers | 2017-04-25 | Paper |
| The Ackermann Award 2013 | 2017-02-02 | Paper |
| Approximate Determinization of Quantitative Automata | 2017-01-26 | Paper |
| Model measuring for discrete and hybrid systems | 2016-12-15 | Paper |
| PSync: a partially synchronous language for fault-tolerant distributed algorithms | 2016-10-24 | Paper |
| Dynamic Resource Allocation Games | 2016-09-29 | Paper |
| Succinct Representation of Concurrent Trace Sets | 2016-09-29 | Paper |
| Segment Abstraction for Worst-Case Execution Time Analysis | 2016-04-26 | Paper |
| Lipschitz Robustness of Timed I/O Systems | 2016-03-23 | Paper |
| Abstraction-driven Concolic Testing | 2016-03-23 | Paper |
| Randomness for free | 2015-12-07 | Paper |
| Alternating-time temporal logic | 2015-12-07 | Paper |
| Abstractions from proofs | 2015-11-11 | Paper |
| Edit Distance for Pushdown Automata | 2015-11-04 | Paper |
| Finitary winning in ω-regular games | 2015-09-17 | Paper |
| Quantitative languages | 2015-09-17 | Paper |
| Qualitative concurrent parity games | 2015-09-17 | Paper |
| Temporal Specifications with Accumulative Values | 2015-09-17 | Paper |
| Measuring and Synthesizing Systems in Probabilistic Environments | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501249 | 2015-08-03 | Paper |
| The benefits of relaxing punctuality | 2015-06-19 | Paper |
| Parametric real-time reasoning | 2015-05-07 | Paper |
| The complexity of multi-mean-payoff and multi-energy games | 2015-05-04 | Paper |
| Aspect-oriented linearizability proofs | 2015-04-22 | Paper |
| Lazy abstraction | 2015-03-17 | Paper |
| A Logic-Based Framework for Verifying Consensus Algorithms | 2015-01-13 | Paper |
| Interface simulation distances | 2014-12-02 | Paper |
| Quantitative abstraction refinement | 2014-11-27 | Paper |
| Quantitative relaxation of concurrent data structures | 2014-11-27 | Paper |
| Proving non-termination | 2014-09-12 | Paper |
| Synthesizing robust systems | 2014-07-03 | Paper |
| A survey of partial-observation stochastic parity games | 2014-06-30 | Paper |
| Battery transition systems | 2014-04-10 | Paper |
| Exact and Approximate Determinization of Discounted-Sum Automata | 2014-03-24 | Paper |
| Aspect-Oriented Linearizability Proofs | 2013-08-12 | Paper |
| From Model Checking to Model Measuring | 2013-08-12 | Paper |
| Strategy improvement for concurrent reachability and turn-based stochastic safety games | 2013-07-24 | Paper |
| Model checking transactional memories | 2013-06-28 | Paper |
| Verification of STM on relaxed memory models | 2012-09-27 | Paper |
| Determinizing discounted-sum automata | 2012-09-18 | Paper |
| Generalized Mean-payoff and Energy Games | 2012-08-29 | Paper |
| Ideal Abstractions for Well-Structured Transition Systems | 2012-06-15 | Paper |
| Lumpability abstractions of rule-based systems | 2012-05-30 | Paper |
| A survey of stochastic \(\omega \)-regular games | 2012-05-11 | Paper |
| Timed Parity Games: Complexity and Robustness | 2012-04-02 | Paper |
| Simulation distances | 2012-03-13 | Paper |
| Dynamic Reactive Modules | 2011-09-02 | Paper |
| FORMALISMS FOR SPECIFYING MARKOVIAN POPULATION MODELS | 2011-07-14 | Paper |
| The Complexity of Request-Response Games | 2011-06-03 | Paper |
| QUASY: Quantitative Synthesis Tool | 2011-05-19 | Paper |
| Approximation of event probabilities in noisy cellular processes | 2011-05-03 | Paper |
| ABC: Algebraic Bound Computation for Loops | 2011-01-07 | Paper |
| Aligators for Arrays (Tool Paper) | 2010-10-12 | Paper |
| Strategy construction for parity games with imperfect information | 2010-10-07 | Paper |
| Probabilistic Automata on Infinite Words: Decidability and Undecidability Results | 2010-10-04 | Paper |
| Expressiveness and Closure Properties for Quantitative Languages | 2010-09-21 | Paper |
| Quantitative Simulation Games | 2010-09-07 | Paper |
| Randomness for Free | 2010-09-03 | Paper |
| Qualitative Analysis of Partially-Observable Markov Decision Processes | 2010-09-03 | Paper |
| Simulation Distances | 2010-08-31 | Paper |
| Mean-Payoff Automaton Expressions | 2010-08-31 | Paper |
| The complexity of quantitative concurrent parity games | 2010-08-16 | Paper |
| Strategy logic | 2010-06-25 | Paper |
| Forward Analysis of Depth-Bounded Processes | 2010-04-27 | Paper |
| Computer Aided Verification | 2010-04-20 | Paper |
| Reduction of stochastic parity to stochastic mean-payoff games | 2010-04-19 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| Verification: Theory and Practice | 2010-03-23 | Paper |
| Invariant and Type Inference for Matrices | 2010-01-14 | Paper |
| Programming Languages and Systems | 2010-01-05 | Paper |
| Formalisms for Specifying Markovian Population Models | 2009-11-19 | Paper |
| Probabilistic Systems with LimSup and LimInf Objectives | 2009-11-12 | Paper |
| Probabilistic Weighted Automata | 2009-10-22 | Paper |
| Alternating Weighted Automata | 2009-10-20 | Paper |
| Stochastic Games with Finitary Objectives | 2009-10-16 | Paper |
| A Survey of Stochastic Games with Limsup and Liminf Objectives | 2009-07-14 | Paper |
| Better Quality in Synthesis through Quantitative Objectives | 2009-06-30 | Paper |
| Software Transactional Memory on Relaxed Memory Models | 2009-06-30 | Paper |
| Sliding Window Abstraction for Infinite Markov Chains | 2009-06-30 | Paper |
| Algorithms for Omega-Regular Games with Imperfect Information | 2009-03-12 | Paper |
| Solving Games Without Determinization | 2009-03-12 | Paper |
| Valigator: A Verification Tool with Bound and Invariant Generation | 2009-01-27 | Paper |
| Timed Parity Games: Complexity and Robustness | 2008-12-02 | Paper |
| Completeness and Nondeterminism in Model Checking Transactional Memories | 2008-11-25 | Paper |
| Environment Assumptions for Synthesis | 2008-11-25 | Paper |
| Strategy Construction for Parity Games with Imperfect Information | 2008-11-25 | Paper |
| EQUIVALENCE OF LABELED MARKOV CHAINS | 2008-11-24 | Paper |
| Quantitative Languages | 2008-11-20 | Paper |
| Permissiveness in Transactional Memories | 2008-11-20 | Paper |
| Strategy Logic | 2008-09-18 | Paper |
| Controller Synthesis with Budget Constraints | 2008-09-02 | Paper |
| Trading Infinite Memory for Uniform Randomness in Timed Games | 2008-09-02 | Paper |
| Stochastic limit-average games are in EXPTIME | 2008-07-25 | Paper |
| Value Iteration | 2008-07-15 | Paper |
| Timed Alternating-Time Temporal Logic | 2008-07-08 | Paper |
| Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions | 2008-06-17 | Paper |
| Model-Checking ω-Regular Properties of Interval Markov Chains | 2008-04-11 | Paper |
| Invariant Synthesis for Combined Theories | 2008-04-04 | Paper |
| Markov Decision Processes with Multiple Objectives | 2008-03-19 | Paper |
| Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games | 2008-03-19 | Paper |
| Games, Time, and Probability: Graph Models for System Design and Analysis | 2008-03-07 | Paper |
| Concurrent reachability games | 2007-12-19 | Paper |
| Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis | 2007-11-29 | Paper |
| Minimum-Time Reachability in Timed Games | 2007-11-28 | Paper |
| Algorithms for Omega-Regular Games with Imperfect Information | 2007-11-15 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-28 | Paper |
| Hybrid Systems: Computation and Control | 2007-09-25 | Paper |
| Abstract Counterexample-Based Refinement for Powerset Domains | 2007-09-24 | Paper |
| Generalized Parity Games | 2007-09-07 | Paper |
| Antichains: A New Algorithm for Checking Universality of Finite Automata | 2007-09-05 | Paper |
| Strategy Improvement for Stochastic Rabin and Streett Games | 2007-09-04 | Paper |
| Assume-Guarantee Synthesis | 2007-09-03 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-05-02 | Paper |
| Games with secure equilibria | 2006-12-07 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Formal Modeling and Analysis of Timed Systems | 2006-11-14 | Paper |
| Formal Modeling and Analysis of Timed Systems | 2006-11-14 | Paper |
| Formal Methods for Components and Objects | 2006-11-01 | Paper |
| Correct Hardware Design and Verification Methods | 2006-10-20 | Paper |
| On the universal and existential fragments of the \(\mu\)-calculus | 2006-04-28 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Applications and Theory of Petri Nets 2004 | 2005-12-23 | Paper |
| Model checking discounted temporal properties | 2005-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692280 | 2005-09-28 | Paper |
| Static Analysis | 2005-08-24 | Paper |
| Stack size analysis for interrupt-driven programs | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817545 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818798 | 2004-09-24 | Paper |
| From pre-historic to post-modern symbolic model checking | 2004-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813395 | 2004-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737196 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736569 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736580 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473719 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473721 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449227 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449238 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4439559 | 2003-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4439562 | 2003-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4439564 | 2003-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426387 | 2003-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417913 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411830 | 2003-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4804885 | 2003-05-01 | Paper |
| Synchronous and Bidirectional Component Interfaces | 2003-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4804914 | 2003-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4804923 | 2003-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791844 | 2003-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791854 | 2003-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791855 | 2003-02-03 | Paper |
| Fair simulation | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536620 | 2002-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536448 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552451 | 2002-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552473 | 2002-09-03 | Paper |
| Axioms for real-time logics | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234084 | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230338 | 2002-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754083 | 2001-11-11 | Paper |
| Partial-order reduction in symbolic state-space exploration | 2001-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722062 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518901 | 2001-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2703739 | 2001-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503930 | 2000-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518893 | 2000-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953389 | 2000-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501519 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953388 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4270068 | 2000-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252730 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251916 | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251919 | 2000-01-12 | Paper |
| Discrete-time control for rectangular hybrid automata | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4270053 | 1999-11-10 | Paper |
| Event-clock automata: a determinizable class of timed automata | 1999-01-12 | Paper |
| What's decidable about hybrid automata? | 1999-01-06 | Paper |
| Algorithmic analysis of nonlinear hybrid systems | 1998-06-08 | Paper |
| The benefits of relaxing punctuality | 1998-01-19 | Paper |
| The algorithmic analysis of hybrid systems | 1997-02-28 | Paper |
| Real-time system = discrete system + clock variables | 1997-01-01 | Paper |
| HyTech: A model checker for hybrid systems | 1997-01-01 | Paper |
| A really temporal logic | 1995-03-08 | Paper |
| Symbolic model checking for real-time systems | 1995-02-13 | Paper |
| Temporal proof methodologies for timed transition systems | 1994-10-12 | Paper |
| Real-time logics: Complexity and expressiveness | 1993-12-06 | Paper |
| Sooner is safer than later | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3696551 | 1985-01-01 | Paper |
