Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Dedicated to the Memory of Professor Manfred Kudlek
Article type: Research Article
Authors: Jard, Claude | Lime, Didier | Roux, Olivier H.
Affiliations: Université de Nantes, LINA, Nantes, France. Claude.Jard@univ-nantes.fr | École Centrale de Nantes, IRCCyN, Nantes, France. Didier.Lime@irccyn.ec-nantes.fr | École Centrale de Nantes, IRCCyN, Nantes, France. Olivier-H.Roux@irccyn.ec-nantes.fr
Note: [] This work was partially funded by the ANR national research program ImpRo (ANR-2010-BLAN-0317).
Note: [] This work was partially funded by the ANR national research program ImpRo (ANR-2010-BLAN-0317). Address for correspondence: École Centrale de Nantes, 1 rue de la Noë, BP92101, 44321 Nantes Cedex 3, France
Note: [] This work was partially funded by the ANR national research program ImpRo (ANR-2010-BLAN-0317).
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 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 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 CTS model 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.
Keywords: Real-time systems, Timed models, Timed Automata, Time Petri nets
DOI: 10.3233/FI-2014-962
Journal: Fundamenta Informaticae, vol. 129, no. 1-2, pp. 85-100, 2014
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl