Symbolic Unfoldings for Networks of Timed Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

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]
Fichier principal
Vignette du fichier
atva-06.pdf (318.37 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00363033 , version 1 (20-02-2009)

Identifiers

  • HAL Id : inria-00363033 , version 1

Cite

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⟩
245 View
276 Download

Share

Gmail Facebook X LinkedIn More