Interrupt Timed Automata

DOI10.1007/978-3-642-00596-1_15zbMath1234.68195OpenAlexW1731343872MaRDI QIDQ3617730

Serge Haddad, Béatrice Bérard

Publication date: 31 March 2009

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-642-00596-1_15

zbMATH Keywords

hybrid automatatimed automatainterruptionsdecidability of reachabilitymulti-task systems

Mathematics Subject Classification ID

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

Related Items (6)

Polynomial interrupt timed automata: verification and expressiveness ⋮ A survey of timed automata for the development of real-time systems ⋮ A study on shuffle, stopwatches and independently evolving clocks ⋮ Interrupt timed automata: verification and expressiveness ⋮ Revisiting reachability in polynomial interrupt timed automata ⋮ Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algorithmic analysis of hybrid systems
• What's decidable about hybrid automata?
• A theory of timed automata
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• Decidable integration graphs.
• Forward analysis of updatable timed automata
• Algorithmic analysis of polygonal hybrid systems. I: Reachability
• On model-checking timed automata with stopwatch observers
• Symbolic reachability computation for families of linear vector fields

This page was built for publication: Interrupt Timed Automata