Regular set of representatives for time-constrained MSC graphs

DOI10.1016/J.IPL.2012.05.002MaRDI QIDQ436617zbMATHOpenAlexFDO

Authors S. Akshay, Blaise Genest, Loïc Hélouët, 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

formal languagesformal methodstimed automataspecification 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)

Recommendations

• scientific article; zbMATH DE number 5587270
• Symbolically Bounding the Drift in Time-Constrained MSC Graphs
• Mengerian temporal graphs revisited
• scientific article; zbMATH DE number 3910116
• On interval representations of graphs
• Assigning times to minimise reachability in temporal graphs
• scientific article; zbMATH DE number 3874960
• Time constrained graph searching
• Optimizing reachability sets in temporal graphs by delaying
• On representable graphs

Cites work

• scientific article; zbMATH DE number 2081110 (Why is no real title available?)
• scientific article; zbMATH DE number 1418329 (Why is no real title available?)
• scientific article; zbMATH DE number 5587270 (Why is no real title available?)
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• A partial order semantics approach to the clock explosion problem of timed automata
• A theory of regular MSC languages
• A theory of timed automata
• Checking Coverage for Infinite Collections of Timed Scenarios
• Distributed Time-Asynchronous Automata
• Model checking time-constrained scenario-based specifications
• Regular set of representatives for time-constrained MSC graphs
• Symbolic Unfoldings for Networks of Timed Automata
• Symbolically Bounding the Drift in Time-Constrained MSC Graphs
• Timed Unfoldings for Networks of Timed Automata
• When Are Timed Automata Determinizable?

Cited in

(4)

• Quantitative analysis of communication scenarios
• Regular set of representatives for time-constrained MSC graphs
• scientific article; zbMATH DE number 5587270 (Why is no real title available?)
• Symbolically Bounding the Drift in Time-Constrained MSC Graphs

This page was built for publication: Regular set of representatives for time-constrained MSC graphs

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