On Interleaving in Timed Automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

On Interleaving in Timed Automata

Ramzi Ben Salah
  • Function : Author
Marius Bozga
Oded Maler
  • Function : Author
  • PersonId : 840888

Abstract

We propose a remedy to that part of the state-explosion problem for timed automata which is due to interleaving of actions. We prove the following quite surprising result: the union of all zones reached by different interleavings of the same set of transitions is convex. Consequently we can improve the standard reachability computation for timed automata by merging such zones whenever they are encountered. Since passage of time distributes over union, we can continue the successor computation from the new zone and eliminate completely the explosion due to interleaving.
Fichier principal
Vignette du fichier
concur06.pdf (126.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00369800 , version 1 (21-03-2009)

Identifiers

Cite

Ramzi Ben Salah, Marius Bozga, Oded Maler. On Interleaving in Timed Automata. CONCUR 2006 - Concurrency Theory 17th International Conference, CONCUR 2006, Aug 2006, Bonn, Germany. pp.456-476, ⟨10.1007/11817949⟩. ⟨hal-00369800⟩
222 View
248 Download

Altmetric

Share

Gmail Facebook X LinkedIn More