Anonymized Reachability of Hybrid Automata Networks

DOI10.1007/978-3-319-10512-3_10zbMath1448.68301OpenAlexW154301702MaRDI QIDQ5500560

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)

This page was built for publication: Anonymized Reachability of Hybrid Automata Networks