ω-Process Languages for Place/Transition Nets

The definition of process admitted here follows the line developed for elementary (1-safe) Petri nets and published in [Cza 99], [Cza 2000a], [Cza-Kud 2000]. It pertains not to any particular net, thus allows for collecting processes into arbitrary sets, i.e. process languages, and for asking questions like: for a given process language decide if there exists a Place/Transition net and if yes, contruct it (synthesis). The collection of all process languages is a semantic domain for Place/Transition nets. ω-process languages contain both finite and infinite processes. The main problems pursued are analysis, synthesis and iteration lemmata for ω-process languages. Surprisingly, the problems enjoy much simpler solutions for processes generated by P/T nets than generated by elementary nets.

[1]  Manfred Kudlek,et al.  Rational, Linear and Algebraic Process Languages and Iteration Lemmata , 2000, Fundam. Informaticae.

[2]  Jonathan S. Golan,et al.  The theory of semirings with applications in mathematics and theoretical computer science , 1992, Pitman monographs and surveys in pure and applied mathematics.

[3]  Eike Best,et al.  Nonsequential Processes , 1988, EATCS Monographs on Theoretical Computer Science.

[4]  Raymond R. Devillers,et al.  Sequential and Concurrent Behaviour in Petri Net Theory , 1987, Theor. Comput. Sci..

[5]  Joost Engelfriet,et al.  Elementary Net Systems , 1996, Applications and Theory of Petri Nets.

[6]  Peter H. Starke,et al.  Processes in Petri Nets , 1981, J. Inf. Process. Cybern..

[7]  Ludwik Czaja.  Process languages and nets , 2000, Theor. Comput. Sci..

[8]  Ludwik Czaja,et al.  Net-Definability of Process Languages , 1999, Fundam. Informaticae.

[9]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[10]  Manfred Kudlek.  Generalized iteration lemmata , 1995 .

[11]  Wolfgang Reisig,et al.  Place or Transition Petri Nets , 1996, Petri Nets.

[12]  Arto Salomaa,et al.  Semirings, Automata and Languages , 1985 .

[13]  Wolfgang Reisig,et al.  The Non-sequential Behavior of Petri Nets , 1983, Inf. Control..