scholarly journals Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences

2006 ◽  
pp. 420-431 ◽  
Author(s):  
Patricia Bouyer ◽  
Serge Haddad ◽  
Pierre-Alain Reynier
Keyword(s):  
Petri Nets ◽  
Timed Automata ◽  
Timed Petri Nets ◽  
Discriminating Power

scholarly journals Timed Petri nets and timed automata: On the discriminating power of zeno sequences

2008 ◽  
Vol 206 (1) ◽  
pp. 73-107 ◽  
Author(s):  
Patricia Bouyer ◽  
Serge Haddad ◽  
Pierre-Alain Reynier
Keyword(s):  
Petri Nets ◽  
Timed Automata ◽  
Timed Petri Nets ◽  
Discriminating Power

scholarly journals Well (and Better) Quasi-Ordered Transition Systems

2010 ◽  
Vol 16 (4) ◽  
pp. 457-515 ◽  
Author(s):  
Parosh Aziz Abdulla
Keyword(s):  
Petri Nets ◽  
Timed Automata ◽  
Timed Petri Nets ◽  
Transition Systems ◽  
State Spaces ◽  
Rewriting Systems ◽  
Symbolic Representations ◽  
Infinite State ◽  
Lossy Channel ◽  
Quasi Ordering

AbstractIn this paper, we give a step by step introduction to the theory ofwell quasi-orderedtransition systems. The framework combines two concepts, namely (i) transition systems which aremonotonicwrt. awell-quasi ordering; and (ii) a scheme for symbolicbackwardreachability analysis. We describe several models with infinite-state spaces, which can be analyzed within the framework, e.g., Petri nets, lossy channel systems, timed automata, timed Petri nets, and multiset rewriting systems. We will also presentbetter quasi-orderedtransition systems which allow the design of efficient symbolic representations of infinite sets of states.

Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets

2013 ◽  
Vol E96.A (2) ◽  
pp. 540-553
Author(s):  
Satoru OCHIIWA ◽  
Satoshi TAOKA ◽  
Masahiro YAMAUCHI ◽  
Toshimasa WATANABE
Keyword(s):  
Petri Nets ◽  
Heuristic Algorithms ◽  
Timed Petri Nets

A Compositional Semantics for Timed Petri Nets1

1990 ◽  
Vol 13 (2) ◽  
pp. 141-170
Author(s):  
Andrea Maggiolo-Schettini ◽  
Józef Winkowski
Keyword(s):  
Petri Nets ◽  
Compositional Semantics ◽  
Timed Petri Nets ◽  
Event Structures ◽  
Configuration Systems

Timed Petri nets and their behaviours are considered. A concept of a seminet is introduced. which generalizes the concept of a net, and suitable operations on seminets are defined, which allow constructing seminets from atoms corresponding to places and transitions. The behaviours of seminets are given in the form of so called configuration systems, a notion close to labelled event structures. Such behaviours can be combined with the aid of operations corresponding to those on seminets. In particular, the behaviour of a compound seminet can be obtained by combining the behaviours of components.

Sign in / Sign up

Export Citation Format

Share Document