Formal Modeling and Analysis of Timed Systems
From MaRDI portal
Publication:5897958
DOI10.1007/11603009zbMath1175.68256OpenAlexW2493457341MaRDI QIDQ5897958
Pierre-Alain Reynier, Patricia Bouyer, François Laroussinie
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11603009
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (12)
Configurable verification of timed automata with discrete variables ⋮ Fast zone-based algorithms for reachability in pushdown timed automata ⋮ Exact Incremental Analysis of Timed Automata with an SMT-Solver ⋮ Bounded Determinization of Timed Automata with Silent Transitions ⋮ A survey of timed automata for the development of real-time systems ⋮ Bounded determinization of timed automata with silent transitions ⋮ Unnamed Item ⋮ Superposition as a decision procedure for timed automata ⋮ Reachability analysis for timed automata using max-plus algebra ⋮ On regions and zones for event-clock automata ⋮ A menagerie of timed automata ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next?
Uses Software
This page was built for publication: Formal Modeling and Analysis of Timed Systems