Skip to Main content Skip to Navigation
New interface
Conference papers

Symbolic Unfoldings for Networks of Timed Automata

Abstract : In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Extended symbolic nets are standard occurrence nets extended with read arcs and symbolic constraints on places and transitions. We prove that there is a complete finite prefix for any NTA that contains at least the information of the simulation graph of the NTA but keep explicit the notions of concurrency and causality of the network.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Franck Cassez Connect in order to contact the contributor
Submitted on : Friday, February 20, 2009 - 1:22:27 AM
Last modification on : Friday, November 18, 2022 - 3:41:27 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 7:04:55 PM


Files produced by the author(s)


  • HAL Id : inria-00363033, version 1


Franck Cassez, Thomas Chatain, Claude Jard. Symbolic Unfoldings for Networks of Timed Automata. 4th Int. Symp. on Automated Technology for Verification and Analysis (ATVA'06), Oct 2006, Beijing, China. pp.307--321. ⟨inria-00363033⟩



Record views


Files downloads