Blending Timed Formal Models with Clock Transition Systems

Abstract : Networks of Timed Automata (NTA) and Time Petri Nets (TPNs) are well-established formalisms used to model, analyze and control industrial real-time systems. The underlying theories are usually developed in different scientific communities and both formalisms have distinct strong points: for instance, conciseness for TPNs and a more flexible notion of urgency for NTA. The objective of the paper is to introduce a new model allowing the joint use of both TPNs and NTA for the modeling of timed systems. We call it Clock Transition System (CTS). This new model incorporates the advantages of the structure of Petri nets, while introducing 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 is introduced by a separate description of invariants. We show that CTSallow to express TPNs (even when unbounded) and NTA. For those two classical models, we identify subclasses of CTSs equivalent by isomorphism of their operational semantics and provide (syntactic) translations. The classical state-space computation developed for NTA and then adapted to TPNs can easily be defined for general CTSs. Armed with these merits, the CTSmodel seems a good candidate to serve as an intermediate theoretical and practical model to factor out the upcoming developments in the TPNs and the NTA scientific communities.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00939239
Contributor : Claude Jard <>
Submitted on : Thursday, January 30, 2014 - 2:36:56 PM
Last modification on : Wednesday, December 19, 2018 - 3:02:03 PM
Document(s) archivé(s) le : Thursday, May 1, 2014 - 5:10:24 AM

File

FI-final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00939239, version 1

Citation

Claude Jard, Didier Lime, Olivier Henri Roux. Blending Timed Formal Models with Clock Transition Systems. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2014, 129 (1-2), pp.85-100. ⟨hal-00939239⟩

Share

Metrics

Record views

1576

Files downloads

108