Petri nets: an introduction
Semirings, automata, languages
Semirings, automata, languages
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Nonsequential processes
The theory of semirings with applications in mathematics and theoretical computer science
The theory of semirings with applications in mathematics and theoretical computer science
Net-definability of process languages
Fundamenta Informaticae - Special issue on Petri nets
Theoretical Computer Science
Rational, linear and algebraic process languages and iteration lemmata
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
The Book of Traces
ω-Process Languages for Place/Transition Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
ω-Process Languages for Place/Transition Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
ω-Process Languages for Place/Transition Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
| Hi-index | 0.00 |
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.