Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems

DOI10.1007/b100824zbMath1109.68512OpenAlexW4206454994MaRDI QIDQ5464753

Véronique Bruyère, Thomas Brihaye, Jean-François Raskin

Publication date: 19 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100824

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (17)

Model Checking Real-Time Systems ⋮ Improved undecidability results on weighted timed automata ⋮ On the freeze quantifier in Constraint LTL: Decidability and complexity ⋮ Quantitative Attack Tree Analysis via Priced Timed Automata ⋮ A survey of timed automata for the development of real-time systems ⋮ A Kleene-Schützenberger theorem for weighted timed automata ⋮ Weighted o-minimal hybrid systems ⋮ Alternation-free weighted mu-calculus: decidability and completeness ⋮ Specifications for decidable hybrid games ⋮ Infinite Runs in Weighted Timed Automata with Energy Constraints ⋮ Optimal reachability for multi-priced timed automata ⋮ Model checking weighted integer reset timed automata ⋮ On model-checking timed automata with stopwatch observers ⋮ Model checking for a class of weighted automata ⋮ A Kleene-Schützenberger Theorem for Weighted Timed Automata ⋮ STORMED Hybrid Games ⋮ Model-checking Timed Temporal Logics

This page was built for publication: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems