Blending Timed Formal Models with Clock Transition Systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Fundamenta Informaticae Année : 2014

Blending Timed Formal Models with Clock Transition Systems

Résumé

In this paper, we propose a new model for the design of safe communicating real-time systems. This model, called Clock Transition System (CTS), supersedes both Networks of Timed Automata (NTA) and Time Petri Nets (TPN) which are usually used for this purpose. It incorporates the advantages of the structure of Petri nets, while intro- ducing explicitly the concept of clocks. Transitions in the network can be guarded by an expression on the clocks and reset a subset of them as in timed automata. The urgency may be introduced by a separate de- scription of invariants. We show that CTS allow to express TPNs (even when unbounded) and NTA. For those two classical models, we identify subclasses of CTSs equivalent by isomorphism of their operational se- mantics and provide (syntactic) translations. We demonstrate the actual usefulness of CTS on a case study and discuss the analysis techniques that can be lifted to this more general model. Armed with these merits, the CTS model seems a good candidate to serve as an intermediate the- oretical and practical model to factor out the upcoming developments in the TPNs and the NTA scientific communities.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
FI-final.pdf (170.48 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00940970 , version 1 (06-02-2014)

Identifiants

  • HAL Id : hal-00940970 , version 1

Citer

Claude Jard, Didier Lime, Olivier Henri Roux. Blending Timed Formal Models with Clock Transition Systems. Fundamenta Informaticae, 2014, 129 (1-2), pp.85-100. ⟨hal-00940970⟩
386 Consultations
290 Téléchargements

Partager

Gmail Facebook X LinkedIn More