Find a copy in the library
Finding libraries that hold this item...
|All Authors / Contributors:||
Alain Finkel; Guy Vidal-Naquet; Université de Paris-Sud.; Université de Paris-Sud. Faculté des Sciences d'Orsay (Essonne).
|Description:||1 vol. (289 p.) : ill. ; 30 cm.|
|Responsibility:||Alain Finkel ; [sous la direction de] Guy Vidal-Naquet.|
We present a structure for transition systems such that mains algorithms on Petri nets can be generalized to structured transition systems. We define the reduced tree of a structured transition system; it allows deciding the finiteness of the reachability set and of the language of firing sequences. The definition of the cover ability graph, introduced by Karp and Miller for parallel program schemata, is extended for well-structured transition systems. We show that quasi-liveness and deadlock freedom are two decidable problems in the framework of well-structured transition systems. We introduce the notion of structured transition systems isomorphism and we show that the finite product of structured transition systems is still a structured transition system. We then apply these results for two classes of structured Fifo nets called monogeneous nets and free choice nets. It is shown that any monogeneous net is simulated by a Petri net intersected with a finite automaton; there also exists a relation between free choice net language and its associated colored Petri net language: this language is included in all permutations of the free choice net language. These two relations allow deciding the liveness of a monogeneous net or a free choice net. Others results about the expression power of Fifo nets, control of processes by finite automaton and formal languages theory of Petri nets and Fifo nets are also given.