An Introduction to Timed Automata

DOI10.1007/978-1-4471-4276-8_9zbMath1304.37012OpenAlexW125458475MaRDI QIDQ5496927

Béatrice Bérard

Publication date: 29 January 2015

Published in: Lecture Notes in Control and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4471-4276-8_9

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum and maximum delay problems in real-time systems
• Model-checking in dense real-time
• A theory of timed automata
• Symbolic model checking for real-time systems
• The power of reachability testing for timed automata
• Kronos: A verification tool for real-time systems
• Forward analysis of updatable timed automata
• Causality versus true-concurrency
• Undecidability of Universality for Timed Automata with Minimal Resources
• Undecidable Problems About Timed Automata
• Timed Automata with Integer Resets: Language Inclusion and Expressiveness
• Undecidability Results for Timed Automata with Silent Transitions
• When Are Timed Automata Determinizable?
• Compositional specification of timed systems
• Formal Methods for the Design of Real-Time Systems
• Formal Methods for the Design of Real-Time Systems
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: An Introduction to Timed Automata