Communication Dans Un Congrès Année : 2022

Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods

R. Govind
  • Fonction : Auteur
  • PersonId : 1132599
B. Srivathsan
  • Fonction : Auteur
  • PersonId : 1049965
Igor Walukiewicz

Résumé

A timed network is a parallel composition of timed automata synchronizing on common actions. We develop a methodology that allows to use partial-order methods when solving the reachability problem for timed networks. It is based on a local-time semantics proposed by [Bengtsson et al. 1998]. A new simulation based abstraction of local-time zones is proposed. The main technical contribution is an efficient algorithm for testing subsumption with respect to this abstraction operator. The abstraction is not finite for all networks. It turns out that, under relatively mild conditions, there is no finite abstraction for local-time zones that works for arbitrary timed networks. To circumvent this problem, we introduce a notion of a bounded-spread network. The spread of a network is a parameter that says how far the local times of individual processes need to diverge. For bounded-spread networks, we show that it is possible to use subsumption and partial-order methods at the same time.

Fichier principal
Vignette du fichier
m (1).pdf (716.08 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-03644039 , version 1 (18-04-2022)
hal-03644039 , version 2 (02-05-2022)

Licence

Identifiants

  • HAL Id : hal-03644039 , version 2

Citer

R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods. 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, Aug 2022, Haifa, Israel. ⟨hal-03644039v2⟩
275 Consultations
469 Téléchargements

Partager

  • More