Symbolic Unfoldings for Networks of Timed Automata

DOI10.1007/11901914_24MaRDI QIDQ3522917zbMATH OpenOpenAlexFDO

Authors Franck Cassez, Thomas Chatain, Claude Jard

Publication date 4 September 2008

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11901914_24

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Timed Unfoldings for Networks of Timed Automata
• Symbolic and compositional reachability for timed automata
• Symbolic unfolding of parametric stopwatch Petri nets
• Symbolic unfolding of parametric stopwatch Petri nets
• Symbolic Robustness Analysis of Timed Automata
• Formal Modeling and Analysis of Timed Systems
• Approximate Symbolic Reachability of Networks of Transition Systems
• Theoretical Aspects of Computing – ICTAC 2005

Cited in

(6)

• Symbolic unfolding of parametric stopwatch Petri nets
• Timed Unfoldings for Networks of Timed Automata
• Approximate Symbolic Reachability of Networks of Transition Systems
• Regular set of representatives for time-constrained MSC graphs
• A local-time semantics for negotiations
• Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods

Describes a project that uses

Uses Software

• Romeo
• CMC
• HyTech

This page was built for publication: Symbolic Unfoldings for Networks of Timed Automata

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