petri nets
Recently Published Documents


TOTAL DOCUMENTS

8992
(FIVE YEARS 1651)

H-INDEX

96
(FIVE YEARS 20)

Automatica ◽  
2022 ◽  
Vol 137 ◽  
pp. 110119
Author(s):  
Hanifa Boucheneb ◽  
Kamel Barkaoui ◽  
Qian Xing ◽  
KuangZe Wang ◽  
GaiYun Liu ◽  
...  

Automatica ◽  
2022 ◽  
Vol 136 ◽  
pp. 110031
Author(s):  
Ziyue Ma ◽  
Zhou He ◽  
Zhiwu Li ◽  
Alessandro Giua
Keyword(s):  

2022 ◽  
Vol 9 (2) ◽  
pp. 329-338
Author(s):  
Dan You ◽  
Oussama Karoui ◽  
Shouguang Wang
Keyword(s):  

Automatica ◽  
2022 ◽  
Vol 136 ◽  
pp. 110074
Author(s):  
Manuel Navarro-Gutiérrez ◽  
Antonio Ramírez-Treviño ◽  
Manuel Silva
Keyword(s):  

2022 ◽  
Vol 183 (3-4) ◽  
pp. 169-201
Author(s):  
Xavier Allamigeon ◽  
Marin Boyet ◽  
Stéphane Gaubert

We study timed Petri nets, with preselection and priority routing. We represent the behavior of these systems by piecewise affine dynamical systems. We use tools from the theory of nonexpansive mappings to analyze these systems. We establish an equivalence theorem between priority-free fluid timed Petri nets and semi-Markov decision processes, from which we derive the convergence to a periodic regime and the polynomial-time computability of the throughput. More generally, we develop an approach inspired by tropical geometry, characterizing the congestion phases as the cells of a polyhedral complex. We illustrate these results by a current application to the performance evaluation of emergency call centers in the Paris area. We show that priorities can lead to a paradoxical behavior: in certain regimes, the throughput of the most prioritary task may not be an increasing function of the resources.


2022 ◽  
Vol 183 (1-2) ◽  
pp. 97-123
Author(s):  
Didier Lime ◽  
Olivier H. Roux ◽  
Charlotte Seidner

We investigate the problem of parameter synthesis for time Petri nets with a cost variable that evolves both continuously with time, and discretely when firing transitions. More precisely, parameters are rational symbolic constants used for time constraints on the firing of transitions and we want to synthesise all their values such that some marking is reachable, with a cost that is either minimal or simply less than a given bound. We first prove that the mere existence of values for the parameters such that the latter property holds is undecidable. We nonetheless provide symbolic semi-algorithms for the two synthesis problems and we prove them both sound and complete when they terminate. We also show how to modify them for the case when parameter values are integers. Finally, we prove that these modified versions terminate if parameters are bounded. While this is to be expected since there are now only a finite number of possible parameter values, our algorithms are symbolic and thus avoid an explicit enumeration of all those values. Furthermore, the results are symbolic constraints representing finite unions of convex polyhedra that are easily amenable to further analysis through linear programming. We finally report on the implementation of the approach in Romeo, a software tool for the analysis of time Petri nets.


2022 ◽  
Vol 183 (1-2) ◽  
pp. 33-66
Author(s):  
Alain Finkel ◽  
Serge Haddad ◽  
Igor Khmelnitsky

In the early two-thousands, Recursive Petri nets have been introduced in order to model distributed planning of multi-agent systems for which counters and recursivity were necessary. Although Recursive Petri nets strictly extend Petri nets and context-free grammars, most of the usual problems (reachability, coverability, finiteness, boundedness and termination) were known to be solvable by using non-primitive recursive algorithms. For almost all other extended Petri nets models containing a stack, the complexity of coverability and termination are unknown or strictly larger than EXPSPACE. In contrast, we establish here that for Recursive Petri nets, the coverability, termination, boundedness and finiteness problems are EXPSPACE-complete as for Petri nets. From an expressiveness point of view, we show that coverability languages of Recursive Petri nets strictly include the union of coverability languages of Petri nets and context-free languages. Thus we get a more powerful model than Petri net for free.


2022 ◽  
Vol 183 (1-2) ◽  
pp. 67-96
Author(s):  
David de Frutos Escrig ◽  
Maciej Koutny ◽  
Łukasz Mikulski

In reversible computations one is interested in the development of mechanisms allowing to undo the effects of executed actions. The past research has been concerned mainly with reversing single actions. In this paper, we consider the problem of reversing the effect of the execution of groups of actions (steps). Using Petri nets as a system model, we introduce concepts related to this new scenario, generalising notions used in the single action case. We then present properties arising when reverse actions are allowed in place/transition nets (PT-nets). We obtain both positive and negative results, showing that allowing steps makes reversibility more problematic than in the interleaving/sequential case. In particular, we demonstrate that there is a crucial difference between reversing steps which are sets and those which are true multisets. Moreover, in contrast to sequential semantics, splitting reverses does not lead to a general method for reversing bounded PT-nets. We then show that a suitable solution can be obtained by combining split reverses with weighted read arcs.


2022 ◽  
Vol 183 (1-2) ◽  
pp. 125-167
Author(s):  
Ronny Tredup

For a fixed type of Petri nets τ, τ-SYNTHESIS is the task of finding for a given transition system A a Petri net N of type τ(τ-net, for short) whose reachability graph is isomorphic to A if there is one. The decision version of this search problem is called τ-SOLVABILITY. If an input A allows a positive decision, then it is called τ-solvable and a sought net N τ-solves A. As a well known fact, A is τ-solvable if and only if it has the so-called τ-event state separation property (τ-ESSP, for short) and the τ-state separation property (τ-SSP, for short). The question whether A has the τ-ESSP or the τ-SSP defines also decision problems. In this paper, for all b ∈ ℕ, we completely characterize the computational complexity of τ-SOLVABILITY, τ-ESSP and τ-SSP for the types of pure b-bounded Place/Transition-nets, the b-bounded Place/Transitionnets and their corresponding ℤb+1-extensions.


2022 ◽  
Vol 183 (3-4) ◽  
pp. 243-291
Author(s):  
Olivier Finkel ◽  
Michał Skrzypczak

We prove that ω-languages of (non-deterministic) Petri nets and ω-languages of (nondeterministic) Turing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Petri nets are equal to the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Turing machines. We also show that it is highly undecidable to determine the topological complexity of a Petri net ω-language. Moreover, we infer from the proofs of the above results that the equivalence and the inclusion problems for ω-languages of Petri nets are ∏21-complete, hence also highly undecidable. Additionally, we show that the situation is quite the opposite when considering unambiguous Petri nets, which have the semantic property that at most one accepting run exists on every input. We provide a procedure of determinising them into deterministic Muller counter machines with counter copying. As a consequence, we entail that the ω-languages recognisable by unambiguous Petri nets are △30 sets.


Sign in / Sign up

Export Citation Format

Share Document