Regular set of representatives for time-constrained MSC graphs

DOI10.1016/j.ipl.2012.05.002zbMath1243.68218OpenAlexW1963663203MaRDI QIDQ436617

Loïc Hélouët, S. Akshay, Blaise Genest, Shaofa Yang

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-00647720/file/RR-7823.pdf

zbMATH Keywords

timed automataspecification languagesformal methodsformal languagesMSC graphspartial order languagesset of representatives

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)

Related Items

Quantitative Analysis of Communication Scenarios ⋮ Regular set of representatives for time-constrained MSC graphs

Cites Work

• Regular set of representatives for time-constrained MSC graphs
• A theory of timed automata
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• A theory of regular MSC languages
• A partial order semantics approach to the clock explosion problem of timed automata
• Symbolically Bounding the Drift in Time-Constrained MSC Graphs
• Timed Unfoldings for Networks of Timed Automata
• Symbolic Unfoldings for Networks of Timed Automata
• Distributed Time-Asynchronous Automata
• Checking Coverage for Infinite Collections of Timed Scenarios
• When Are Timed Automata Determinizable?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item