Petri nets: an introduction
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Branching processes of Petri nets
Acta Informatica
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)
Agent-Based Flow Control for HLA Components
Simulation
Scientific workflow management: between generality and applicability
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Associative Omega-product of Processes
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Boolean Algebra of Nets, their Synthesis and Analysis
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Analysis and Synthesis of Net Structures and Transition Graphs
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Hi-index | 0.00 |
Four semantic domains for Place/Transition Petri nets and their relationships are considered. They are monoids of respectively: firing sequences, processes, traces and dependence graphs. For each of them the analysis and synthesis problem is stated and solved. The monoid of processes is defined in a non-standard way. Nets under consideration involve weights of arrows and capacities (finite or infinite) of places. However, the analysis and synthesis tasks require nets to be pure, i.e. each of their transition must have the pre-set and post-set disjoint.