| Publication | Date of Publication | Type |
|---|
Regular methods for operator precedence languages
| 2024-11-14 | Paper |
History-deterministic timed automata
Logical Methods in Computer Science | 2024-11-12 | Paper |
History-deterministic timed automata
| 2024-08-13 | Paper |
An updated survey of bidding games on graphs (invited talk)
| 2024-08-06 | Paper |
Synthesis of hybrid automata with affine dynamics from time-series data
Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control | 2024-02-21 | Paper |
Membership-based synthesis of linear hybrid automata
Computer Aided Verification | 2024-02-16 | Paper |
Run-time optimization for learned controllers through quantitative games
Computer Aided Verification | 2024-02-16 | Paper |
Information-flow interfaces
| 2024-01-23 | Paper |
Monitoring algorithmic fairness
| 2024-01-12 | Paper |
A learner-verifier framework for neural network controllers and certificates of stochastic systems
| 2023-12-13 | Paper |
Quantitative safety and liveness
Lecture Notes in Computer Science | 2023-11-24 | Paper |
History-deterministic timed automata are not determinizable
Lecture Notes in Computer Science | 2023-07-21 | Paper |
State equivalences for rectangular hybrid automata
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
A space-efficient on-the-fly algorithm for real-time model checking
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
Synthesis of parametric hybrid automata from time series
Automated Technology for Verification and Analysis | 2023-06-02 | Paper |
Space-time interpolants
Computer Aided Verification | 2023-05-26 | Paper |
Reachable set over-approximation for nonlinear systems using piecewise barrier tubes
Computer Aided Verification | 2023-05-26 | Paper |
Modularity for timed and hybrid systems
CONCUR '97: Concurrency Theory | 2023-05-17 | Paper |
Fair simulation
CONCUR '97: Concurrency Theory | 2023-05-17 | Paper |
scientific article; zbMATH DE number 7650833 (Why is no real title available?)
| 2023-02-07 | Paper |
Long-Run Average Behavior of Vector Addition Systems with States
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7649928 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7561655 (Why is no real title available?)
| 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?
Tools and Algorithms for the Construction and Analysis of Systems | 2021-11-10 | Paper |
Long lived transients in gene regulation
Theoretical Computer Science | 2021-11-01 | Paper |
Synchronizing the asynchronous
| 2021-08-04 | Paper |
Interface simulation distances
| 2021-04-27 | Paper |
Bidding mechanisms in graph games
Journal of Computer and System Sciences | 2021-04-14 | Paper |
scientific article; zbMATH DE number 7327943 (Why is no real title available?)
| 2021-03-26 | Paper |
Refinement for structured concurrent programs
| 2021-02-04 | Paper |
A theory of register monitors
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Computing scores of forwarding schemes in switched networks with probabilistic faults
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
Counterexample-Guided Refinement of Template Polyhedra
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
Infinite-duration poorman-bidding games
| 2020-06-18 | Paper |
Infinite-duration bidding games
| 2020-05-27 | Paper |
Bidirectional nested weighted automata
| 2020-05-27 | Paper |
The cost of exactness in quantitative reachability
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Infinite-duration Bidding Games
Journal of the ACM | 2020-02-11 | Paper |
Dynamic resource allocation games
Theoretical Computer Science | 2020-01-22 | Paper |
What good are digital clocks?
Automata, Languages and Programming | 2019-12-04 | Paper |
Bidding games on Markov decision processes
| 2019-10-22 | Paper |
Transient memory in gene regulation
| 2019-10-10 | Paper |
Faster statistical model checking for unbounded temporal properties
Lecture Notes in Computer Science | 2019-09-17 | Paper |
Model Checking Gene Regulatory Networks
Tools and Algorithms for the Construction and Analysis of Systems | 2019-09-17 | Paper |
Quantitative automata under probabilistic semantics
Logical Methods in Computer Science | 2019-08-13 | Paper |
Termination criteria for solving concurrent safety and reachability games
| 2019-05-06 | Paper |
Array Folds Logic
Computer Aided Verification | 2019-05-03 | Paper |
Hybrid automata with finite bisimulations
Automata, Languages and Programming | 2019-01-10 | Paper |
The expressive power of clocks
Automata, Languages and Programming | 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
Handbook of Model Checking | 2018-07-20 | Paper |
Discrete-time control for rectangular hybrid automata
Automata, Languages and Programming | 2018-07-04 | Paper |
Quantitative automata under probabilistic semantics
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Nested weighted automata
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
The target discounted-sum problem
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Nested weighted automata
ACM Transactions on Computational Logic | 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
Computer Aided Verification | 2018-03-01 | Paper |
Model checking the evolution of gene regulatory networks
Acta Informatica | 2017-12-01 | Paper |
Conic abstractions for hybrid systems
| 2017-12-01 | Paper |
Edit distance for pushdown automata
| 2017-10-12 | Paper |
Faster statistical model checking for unbounded temporal properties
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
A classification of symbolic transition systems
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Scalable static hybridization methods for analysis of nonlinear systems
Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control | 2017-05-19 | Paper |
Model measuring for hybrid systems
Proceedings of the 17th international conference on Hybrid systems: computation and control | 2017-05-16 | Paper |
From non-preemptive to preemptive scheduling using synchronization synthesis
Formal Methods in System Design | 2017-05-15 | Paper |
Quantitative fair simulation games
Information and Computation | 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
Nonlinear Analysis. Hybrid Systems | 2016-12-15 | Paper |
\textsc{PSync}: a partially synchronous language for fault-tolerant distributed algorithms
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
Succinct representation of concurrent trace sets
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
Dynamic resource allocation games
Algorithmic Game Theory | 2016-09-29 | Paper |
Segment Abstraction for Worst-Case Execution Time Analysis
Programming Languages and Systems | 2016-04-26 | Paper |
Abstraction-driven concolic testing
Lecture Notes in Computer Science | 2016-03-23 | Paper |
Lipschitz robustness of timed I/O systems
Lecture Notes in Computer Science | 2016-03-23 | Paper |
Alternating-time temporal logic
Journal of the ACM | 2015-12-07 | Paper |
Randomness for free
Information and Computation | 2015-12-07 | Paper |
Abstractions from proofs
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-11-11 | Paper |
Edit distance for pushdown automata
Automata, Languages, and Programming | 2015-11-04 | Paper |
Finitary winning in \({\omega}\)-regular games
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Quantitative languages
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Temporal specifications with accumulative values
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Qualitative concurrent parity games
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Measuring and synthesizing systems in probabilistic environments
Journal of the ACM | 2015-08-14 | Paper |
Quantitative stochastic parity games
| 2015-08-03 | Paper |
The benefits of relaxing punctuality
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Parametric real-time reasoning
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
The complexity of multi-mean-payoff and multi-energy games
Information and Computation | 2015-05-04 | Paper |
Aspect-oriented linearizability proofs
Logical Methods in Computer Science | 2015-04-22 | Paper |
Lazy abstraction
Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
A logic-based framework for verifying consensus algorithms
Lecture Notes in Computer Science | 2015-01-13 | Paper |
Interface simulation distances
Theoretical Computer Science | 2014-12-02 | Paper |
Quantitative abstraction refinement
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
Quantitative relaxation of concurrent data structures
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
Proving non-termination
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-09-12 | Paper |
Synthesizing robust systems
Acta Informatica | 2014-07-03 | Paper |
A survey of partial-observation stochastic parity games
Formal Methods in System Design | 2014-06-30 | Paper |
Battery transition systems
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
Exact and approximate determinization of discounted-sum automata
Logical Methods in Computer Science | 2014-03-24 | Paper |
From model checking to model measuring
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
Aspect-oriented linearizability proofs
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
Strategy improvement for concurrent reachability and turn-based stochastic safety games
Journal of Computer and System Sciences | 2013-07-24 | Paper |
Model checking transactional memories
Distributed Computing | 2013-06-28 | Paper |
Verification of STM on relaxed memory models
Formal Methods in System Design | 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
Lecture Notes in Computer Science | 2012-06-15 | Paper |
Lumpability abstractions of rule-based systems
Theoretical Computer Science | 2012-05-30 | Paper |
A survey of stochastic \(\omega \)-regular games
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Timed Parity Games: Complexity and Robustness
Logical Methods in Computer Science | 2012-04-02 | Paper |
Simulation distances
Theoretical Computer Science | 2012-03-13 | Paper |
Dynamic Reactive Modules
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Formalisms for specifying Markovian population models
International Journal of Foundations of Computer Science | 2011-07-14 | Paper |
The complexity of request-response games
Language and Automata Theory and Applications | 2011-06-03 | Paper |
QUASY: quantitative synthesis tool
Tools and Algorithms for the Construction and Analysis of Systems | 2011-05-19 | Paper |
Approximation of event probabilities in noisy cellular processes
Theoretical Computer Science | 2011-05-03 | Paper |
ABC: algebraic bound computation for loops
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-01-07 | Paper |
Aligators for Arrays (Tool Paper)
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
Strategy construction for parity games with imperfect information
Information and Computation | 2010-10-07 | Paper |
Probabilistic automata on infinite words: decidability and undecidability results
Automated Technology for Verification and Analysis | 2010-10-04 | Paper |
Expressiveness and closure properties for quantitative languages
Logical Methods in Computer Science | 2010-09-21 | Paper |
Quantitative simulation games
Time for Verification | 2010-09-07 | Paper |
Randomness for free
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Qualitative analysis of partially-observable Markov decision processes
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Simulation distances
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
Mean-payoff automaton expressions
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
The complexity of quantitative concurrent parity games
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Strategy logic
Information and Computation | 2010-06-25 | Paper |
Forward analysis of depth-bounded processes
Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
Thread-modular abstraction refinement.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Reduction of stochastic parity to stochastic mean-payoff games
Information Processing Letters | 2010-04-19 | Paper |
The element of surprise in timed games.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
Verification: Theory and Practice
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Invariant and type inference for matrices
Lecture Notes in Computer Science | 2010-01-14 | Paper |
Model checking: from hardware to software.
Lecture Notes in Computer Science | 2010-01-05 | Paper |
Formalisms for Specifying Markovian Population Models
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Probabilistic Systems with LimSup and LimInf Objectives
Infinity in Logic and Computation | 2009-11-12 | Paper |
Probabilistic Weighted Automata
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
Alternating Weighted Automata
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Stochastic Games with Finitary Objectives
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
A Survey of Stochastic Games with Limsup and Liminf Objectives
Automata, Languages and Programming | 2009-07-14 | Paper |
Sliding Window Abstraction for Infinite Markov Chains
Computer Aided Verification | 2009-06-30 | Paper |
Better Quality in Synthesis through Quantitative Objectives
Computer Aided Verification | 2009-06-30 | Paper |
Software Transactional Memory on Relaxed Memory Models
Computer Aided Verification | 2009-06-30 | Paper |
Algorithms for Omega-Regular Games with Imperfect Information
Computer Science Logic | 2009-03-12 | Paper |
Solving Games Without Determinization
Computer Science Logic | 2009-03-12 | Paper |
Valigator: A Verification Tool with Bound and Invariant Generation
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Timed Parity Games: Complexity and Robustness
Lecture Notes in Computer Science | 2008-12-02 | Paper |
Strategy Construction for Parity Games with Imperfect Information
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Environment Assumptions for Synthesis
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Completeness and Nondeterminism in Model Checking Transactional Memories
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
EQUIVALENCE OF LABELED MARKOV CHAINS
International Journal of Foundations of Computer Science | 2008-11-24 | Paper |
Quantitative Languages
Computer Science Logic | 2008-11-20 | Paper |
Permissiveness in Transactional Memories
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Strategy Logic
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
Trading Infinite Memory for Uniform Randomness in Timed Games
Hybrid Systems: Computation and Control | 2008-09-02 | Paper |
Controller Synthesis with Budget Constraints
Hybrid Systems: Computation and Control | 2008-09-02 | Paper |
Stochastic limit-average games are in EXPTIME
International Journal of Game Theory | 2008-07-25 | Paper |
Value Iteration
25 Years of Model Checking | 2008-07-15 | Paper |
Timed Alternating-Time Temporal Logic
Lecture Notes in Computer Science | 2008-07-08 | Paper |
Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions
Formal Methods in Systems Biology | 2008-06-17 | Paper |
Model-Checking ω-Regular Properties of Interval Markov Chains
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
Invariant Synthesis for Combined Theories
Lecture Notes in Computer Science | 2008-04-04 | Paper |
Markov Decision Processes with Multiple Objectives
STACS 2006 | 2008-03-19 | Paper |
Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
STACS 2006 | 2008-03-19 | Paper |
Games, Time, and Probability: Graph Models for System Design and Analysis
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Concurrent reachability games
Theoretical Computer Science | 2007-12-19 | Paper |
Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis
Computer Aided Verification | 2007-11-29 | Paper |
Minimum-Time Reachability in Timed Games
Automata, Languages and Programming | 2007-11-28 | Paper |
Algorithms for Omega-Regular Games with Imperfect Information
Logical Methods in Computer Science | 2007-11-15 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Hybrid Systems: Computation and Control
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Abstract Counterexample-Based Refinement for Powerset Domains
Program Analysis and Compilation, Theory and Practice | 2007-09-24 | Paper |
Generalized Parity Games
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
Antichains: A New Algorithm for Checking Universality of Finite Automata
Computer Aided Verification | 2007-09-05 | Paper |
Strategy Improvement for Stochastic Rabin and Streett Games
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Assume-Guarantee Synthesis
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Games with secure equilibria
Theoretical Computer Science | 2006-12-07 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-11-14 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Formal Methods for Components and Objects
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Correct Hardware Design and Verification Methods
Lecture Notes in Computer Science | 2006-10-20 | Paper |
On the universal and existential fragments of the \(\mu\)-calculus
Theoretical Computer Science | 2006-04-28 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Applications and Theory of Petri Nets 2004
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Model checking discounted temporal properties
Theoretical Computer Science | 2005-12-06 | Paper |
scientific article; zbMATH DE number 2209335 (Why is no real title available?)
| 2005-09-28 | Paper |
Static Analysis
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Stack size analysis for interrupt-driven programs
Information and Computation | 2005-01-11 | Paper |
scientific article; zbMATH DE number 2102707 (Why is no real title available?)
| 2004-09-24 | Paper |
scientific article; zbMATH DE number 2102714 (Why is no real title available?)
| 2004-09-24 | Paper |
From pre-historic to post-modern symbolic model checking
Formal Methods in System Design | 2004-09-09 | Paper |
scientific article; zbMATH DE number 2090843 (Why is no real title available?)
| 2004-08-13 | Paper |
scientific article; zbMATH DE number 2086659 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2085311 (Why is no real title available?)
| 2004-08-09 | Paper |
scientific article; zbMATH DE number 2085321 (Why is no real title available?)
| 2004-08-09 | Paper |
scientific article; zbMATH DE number 2080758 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080757 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2038772 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 2038762 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 2017343 (Why is no real title available?)
| 2003-12-14 | Paper |
scientific article; zbMATH DE number 2017345 (Why is no real title available?)
| 2003-12-14 | Paper |
scientific article; zbMATH DE number 2017341 (Why is no real title available?)
| 2003-12-14 | Paper |
scientific article; zbMATH DE number 1982210 (Why is no real title available?)
| 2003-09-16 | Paper |
scientific article; zbMATH DE number 1956572 (Why is no real title available?)
| 2003-07-30 | Paper |
scientific article; zbMATH DE number 1948169 (Why is no real title available?)
| 2003-07-10 | Paper |
scientific article; zbMATH DE number 1903344 (Why is no real title available?)
| 2003-05-01 | Paper |
Synchronous and Bidirectional Component Interfaces
Computer Aided Verification | 2003-05-01 | Paper |
scientific article; zbMATH DE number 1903369 (Why is no real title available?)
| 2003-05-01 | Paper |
scientific article; zbMATH DE number 1903378 (Why is no real title available?)
| 2003-05-01 | Paper |
scientific article; zbMATH DE number 1863173 (Why is no real title available?)
| 2003-02-03 | Paper |
scientific article; zbMATH DE number 1863184 (Why is no real title available?)
| 2003-02-03 | Paper |
scientific article; zbMATH DE number 1863183 (Why is no real title available?)
| 2003-02-03 | Paper |
Fair simulation
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1759629 (Why is no real title available?)
| 2002-11-28 | Paper |
scientific article; zbMATH DE number 1759494 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1794356 (Why is no real title available?)
| 2002-09-03 | Paper |
scientific article; zbMATH DE number 1794375 (Why is no real title available?)
| 2002-09-03 | Paper |
Axioms for real-time logics
Theoretical Computer Science | 2002-03-03 | Paper |
scientific article; zbMATH DE number 1263213 (Why is no real title available?)
| 2002-01-27 | Paper |
scientific article; zbMATH DE number 1256652 (Why is no real title available?)
| 2002-01-17 | Paper |
scientific article; zbMATH DE number 1670777 (Why is no real title available?)
| 2001-11-11 | Paper |
Partial-order reduction in symbolic state-space exploration
Formal Methods in System Design | 2001-09-09 | Paper |
scientific article; zbMATH DE number 1617325 (Why is no real title available?)
| 2001-07-11 | Paper |
scientific article; zbMATH DE number 1538045 (Why is no real title available?)
| 2001-05-20 | Paper |
Exploiting design structure in model checking. (Abstract)
| 2001-05-08 | Paper |
scientific article; zbMATH DE number 1507210 (Why is no real title available?)
| 2000-12-06 | Paper |
scientific article; zbMATH DE number 1538038 (Why is no real title available?)
| 2000-12-03 | Paper |
scientific article; zbMATH DE number 1444348 (Why is no real title available?)
| 2000-09-18 | Paper |
scientific article; zbMATH DE number 1500504 (Why is no real title available?)
| 2000-09-04 | Paper |
scientific article; zbMATH DE number 1444347 (Why is no real title available?)
| 2000-06-21 | Paper |
scientific article; zbMATH DE number 1361131 (Why is no real title available?)
| 2000-06-14 | Paper |
scientific article; zbMATH DE number 1306878 (Why is no real title available?)
| 2000-04-26 | Paper |
scientific article; zbMATH DE number 1304994 (Why is no real title available?)
| 2000-01-12 | Paper |
Discrete-time control for rectangular hybrid automata
Theoretical Computer Science | 2000-01-12 | Paper |
scientific article; zbMATH DE number 1304997 (Why is no real title available?)
| 2000-01-12 | Paper |
scientific article; zbMATH DE number 1361119 (Why is no real title available?)
| 1999-11-10 | Paper |
Event-clock automata: a determinizable class of timed automata
Theoretical Computer Science | 1999-01-12 | Paper |
What's decidable about hybrid automata?
Journal of Computer and System Sciences | 1999-01-06 | Paper |
Algorithmic analysis of nonlinear hybrid systems
IEEE Transactions on Automatic Control | 1998-06-08 | Paper |
The benefits of relaxing punctuality
Journal of the ACM | 1998-01-19 | Paper |
The algorithmic analysis of hybrid systems
Theoretical Computer Science | 1997-02-28 | Paper |
HyTech: A model checker for hybrid systems
International Journal on Software Tools for Technology Transfer. STTT | 1997-01-01 | Paper |
Real-time system = discrete system + clock variables
International Journal on Software Tools for Technology Transfer. STTT | 1997-01-01 | Paper |
A really temporal logic
Journal of the ACM | 1995-03-08 | Paper |
Symbolic model checking for real-time systems
Information and Computation | 1995-02-13 | Paper |
Temporal proof methodologies for timed transition systems
Information and Computation | 1994-10-12 | Paper |
Real-time logics: Complexity and expressiveness
Information and Computation | 1993-12-06 | Paper |
Sooner is safer than later
Information Processing Letters | 1993-01-16 | Paper |
scientific article; zbMATH DE number 3922016 (Why is no real title available?)
| 1985-01-01 | Paper |
