Sciweavers

Share
ATVA
2006
Springer

Symbolic Unfoldings for Networks of Timed Automata

10 years 1 months ago
Symbolic Unfoldings for Networks of Timed Automata
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.
Franck Cassez, Thomas Chatain, Claude Jard
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where ATVA
Authors Franck Cassez, Thomas Chatain, Claude Jard
Comments (0)
books