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.
Domains
Other [cs.OH]| Origin | Files produced by the author(s) |
|---|
Loading...