A menagerie of timed automata
From MaRDI portal
Publication:5176174
DOI10.1145/2518102zbMath1305.68113OpenAlexW2010928165MaRDI QIDQ5176174
Peter Fontana, Rance Cleaveland
Publication date: 2 March 2015
Published in: ACM Computing Surveys (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2518102
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Timed modal logics for real-time systems. Specification, verification and control
- Model-checking in dense real-time
- Modeling time in computing.
- Verification of continuous dynamical systems by timed automata
- How to stop time stopping
- Liveness in timed and untimed systems
- What's decidable about hybrid automata?
- A theory of timed automata
- Symbolic model checking for real-time systems
- Time-abstracted bisimulation: Implicit specifications and decidability
- Timed automata and additive clock constraints
- Action transducers and timed automata
- Kronos: A verification tool for real-time systems
- Updatable timed automata
- Forward and backward simulations. I. Untimed Systems
- Forward and backward simulations. II: Timing-based systems
- A study on shuffle, stopwatches and independently evolving clocks
- Scheduling with timed automata
- Checking timed Büchi automata emptiness on simulation graphs
- The Theory of Timed I/O Automata, Second Edition
- Verification, Performance Analysis and Controller Synthesis for Real-Time Systems
- Approximating Continuous Systems by Timed Automata
- Efficient Detection of Zeno Runs in Timed Automata
- Time-Progress Evaluation for Dense-Time Automata with Concave Path Conditions
- From timed automata to logic — and back
- Undecidability Results for Timed Automata with Silent Transitions
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- On the power of non-observable actions in timed automata
- Model-checking Timed Temporal Logics
- Parametric real-time reasoning
- Reachability-Time Games on Timed Automata
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Formal Methods for the Design of Real-Time Systems
- Formal Methods for the Design of Real-Time Systems
- Hybrid Systems: Computation and Control
- Lectures on Concurrency and Petri Nets
- Applications and Theory of Petri Nets 2004
- Formal Modeling and Analysis of Timed Systems
- Formal Methods for Components and Objects
- Formal Modeling and Analysis of Timed Systems
- Real-Time Systems
- Formal Techniques for Networked and Distributed Systems - FORTE 2003
- Analysis of timed systems using time-abstracting bisimulations
- Testing timed automata
This page was built for publication: A menagerie of timed automata
