Anonymized reachability of hybrid automata networks

DOI10.1007/978-3-319-10512-3_10MaRDI QIDQ5500560zbMATHOpenAlexFDO

Authors Taylor T. Johnson, Sayan Mitra

Publication date 6 August 2015

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

Full work available at URL https://doi.org/10.1007/978-3-319-10512-3_10

zbMATH Keywords

verificationsymmetryreachabilityhybrid automata network

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Approximate Symbolic Reachability of Networks of Transition Systems
• Efficient computation and representation of large reachability sets for composed automata
• The Power of Hybrid Acceleration
• scientific article; zbMATH DE number 1836354
• Succinct discrete time approximations of distributed hybrid automata

Cited in

(1)

• Efficient computation and representation of large reachability sets for composed automata

This page was built for publication: Anonymized reachability of hybrid automata networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500560)