scholarly journals Comparison of the Expressiveness of Timed Automata and Time Petri Nets

2005 ◽  
pp. 211-225 ◽  
Author(s):  
Beatrice Bérard ◽  
Franck Cassez ◽  
Serge Haddad ◽  
Didier Lime ◽  
Olivier H. Roux
Keyword(s):  
Petri Nets ◽  
Timed Automata ◽  
Time Petri Nets

scholarly journals Time Petri Nets with Action Duration

2013 ◽  
Vol 4 (2) ◽  
pp. 62-83 ◽  
Author(s):  
N. Belala ◽  
D.E. Saїdouni ◽  
R. Boukharrou ◽  
A.C. Chaouche ◽  
A. Seraoui ◽  
...  
Keyword(s):  
Petri Nets ◽  
Real Time ◽  
Timed Automata ◽  
Operational Semantics ◽  
Time Interval ◽  
Timing Constraints ◽  
Time Petri Nets ◽  
Real Time Systems ◽  
High Level ◽  
Time Systems

The design of real-time systems needs a high-level specification model supporting at the same time timing constraints and actions duration. The authors introduce in this paper an extension of Petri Nets called Time Petri Nets with Action Duration (DTPN) where time is associated with transitions. In DTPN, the firing of transitions is bound to a time interval and transitions represent actions which have explicit durations. The authors give an operational semantics for DTPN in terms of Durational Action Timed Automata (DATA). DTPN considers both timing constraints and durations under a true-concurrency semantics with an aim of better expressing concurrent and parallel behaviours of real-time systems.

scholarly journals ε-TPN: definition of a Time Petri Net formalism simulating the behaviour of the timed grafcets

2019 ◽  
Vol Volume 31 - 2019 - CARI 2018 ◽  
Author(s):  
Médésu Sogbohossou ◽  
Medesu Sogbohossou ◽  
Antoine Vianou ◽  
Nabil Gmati ◽  
Eric Badouel ◽  
...  
Keyword(s):  
Petri Nets ◽  
Control Systems ◽  
Timed Automata ◽  
Operational Semantics ◽  
Formal Modeling ◽  
Time Petri Nets ◽  
Time Petri Net ◽  
Finite State ◽  
Definition Of ◽  
Finite State Space

To allow a formal verification of timed GRAFCET models, many authors proposed to translate them into formal and well-reputed languages such as timed automata or Time Petri nets (TPN). Thus, the work presented in [Sogbohossou, Vianou, Formal modeling of grafcets with Time Petri nets, IEEE Transactions on Control Systems Technology, 23(5)(2015)] concerns the TPN formalism: the resulting TPN of the translation, called here ε-TPN, integrates some infinitesimal delays (ε) to simulate the synchronous semantics of the grafcet. The first goal of this paper is to specify a formal operational semantics for an ε-TPN to amend the previous one: especially, priority is introduced here between two defined categories of the ε-TPN transitions, in order to respect strictly the synchronous hypothesis. The second goal is to provide how to build the finite state space abstraction resulting from the new definitions. Afin de permettre la vérification formelle des grafcets temporisés, plusieurs auteurs ont proposé de les traduire dans des langages formels de réputation tels que les automates temporisés et les réseaux de Petri temporels (TPN). Ainsi, les travaux présentés dans [Sogbohossou, Vianou, Formal modeling of grafcets with Time Petri nets, IEEE Transactions on Control Systems Technology, 23(5)(2015)] concernent le formalisme des TPN: le réseau résultant de la traduction, dénommé ici ε-TPN, intègre des délais infinitésimaux (ε) pour simuler la sémantique synchrone du grafcet. Le premier objectif de cet article est de définir la sémantique opérationnelle d'un ε-TPN afin d'améliorer l'ancienne définition: spécifiquement, une priorité est introduite ici entre deux catégories de transitions définies pour ces réseaux, dans l'optique de respecter rigoureusement l'hypothèse synchrone. Le second but est de fournir une méthode de calcul de l'espace d'état fini qui découle des nouvelles définitions.

scholarly journals A concurrency-preserving translation from time Petri nets to networks of timed automata

2012 ◽  
Vol 40 (3) ◽  
pp. 330-355 ◽  
Author(s):  
Sandie Balaguer ◽  
Thomas Chatain ◽  
Stefan Haar
Keyword(s):  
Petri Nets ◽  
Timed Automata ◽  
Time Petri Nets

scholarly journals Structural Translation from Time Petri Nets to Timed Automata

2005 ◽  
Vol 128 (6) ◽  
pp. 145-160 ◽  
Author(s):  
Franck Cassez ◽  
Olivier-H. Roux
Keyword(s):  
Petri Nets ◽  
Timed Automata ◽  
Time Petri Nets

scholarly journals When are Timed Automata weakly timed bisimilar to Time Petri Nets?

2008 ◽  
Vol 403 (2-3) ◽  
pp. 202-220 ◽  
Author(s):  
B. Bérard ◽  
F. Cassez ◽  
S. Haddad ◽  
D. Lime ◽  
O.H. Roux
Keyword(s):  
Petri Nets ◽  
Timed Automata ◽  
Time Petri Nets

scholarly journals State space computation and analysis of Time Petri Nets

2006 ◽  
Vol 6 (3) ◽  
pp. 301-320 ◽  
Author(s):  
GUILLAUME GARDEY ◽  
OLIVIER H. ROUX ◽  
OLIVIER F. ROUX
Keyword(s):  
Petri Nets ◽  
State Space ◽  
Petri Net ◽  
Timed Automata ◽  
Reactive Systems ◽  
Time Petri Nets ◽  
Classical State ◽  
Time Petri Net ◽  
Reduction Methods ◽  
Timed Automaton

The theory of Petri Nets provides a general framework to specify the behaviors of real-time reactive systems and Time Petri Nets were introduced to take also temporal specifications into account. We present in this paper a forward zone-based algorithm to compute the state space of a bounded Time Petri Net: the method is different and more efficient than the classical State Class Graph. We prove the algorithm to be exact with respect to the reachability problem. Furthermore, we propose a translation of the computed state space into a Timed Automaton, proved to be timed bisimilar to the original Time Petri Net. As the method produce a single Timed Automaton, syntactical clocks reduction methods (DAWS and YOVINE for instance) may be applied to produce an automaton with fewer clocks. Then, our method allows to model-check T-TPN by the use of efficient Timed Automata tools.

scholarly journals Structural translation from Time Petri Nets to Timed Automata

2006 ◽  
Vol 79 (10) ◽  
pp. 1456-1468 ◽  
Author(s):  
Franck Cassez ◽  
Olivier H. Roux
Keyword(s):  
Petri Nets ◽  
Timed Automata ◽  
Time Petri Nets
Sign in / Sign up

Export Citation Format

Share Document