Robust Analysis of Timed Automata Via Channel Machines
From MaRDI portal
Publication:5458357
DOI10.1007/978-3-540-78499-9_12zbMath1138.68431OpenAlexW2082762653MaRDI QIDQ5458357
Nicolas Markey, Patricia Bouyer, Pierre-Alain Reynier
Publication date: 11 April 2008
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78499-9_12
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (10)
Robust Model-Checking of Timed Automata via Pumping in Channel Machines ⋮ Robust Specification of Real Time Components ⋮ Shrinking timed automata ⋮ Expressiveness and succinctness of a logic of robustness ⋮ Robust reachability in timed automata and games: a game-based approach ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Robustness of temporal logic specifications for continuous-time signals ⋮ Robust Analysis of Timed Automata Via Channel Machines ⋮ Timed Automata Can Always Be Made Implementable ⋮ Robust safety of timed automata
Uses Software
Cites Work
- Unnamed Item
- A theory of timed automata
- Uppaal in a nutshell
- Dynamical Properties of Timed Automata Revisited
- Symbolic Robustness Analysis of Timed Automata
- A Temporal Logic of Robustness
- Robust Model-Checking of Linear-Time Properties in Timed Automata
- The benefits of relaxing punctuality
- Hybrid Systems: Computation and Control
- On the decidability and complexity of Metric Temporal Logic over finite words
- Robust Analysis of Timed Automata Via Channel Machines
- Probabilistic and Topological Semantics for Timed Automata
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Hybrid Systems: Computation and Control
- Formal Modeling and Analysis of Timed Systems
This page was built for publication: Robust Analysis of Timed Automata Via Channel Machines