Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Information and Computation
Information and Computation
On Semantics of Petri Nets over Partial Algebra
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Designing the automatic transformation of visual languages
Science of Computer Programming - Special issue on applications of graph transformations (GRATRA 2000)
Two Algebraic Process Semantics for Contextual Nets
Unifying Petri Nets, Advances in Petri Nets
Petri Nets over Partial Algebra
Unifying Petri Nets, Advances in Petri Nets
Journal of Integrated Design & Process Science - Component-Based System Development
Safety Properties In Petri Net Modules
Journal of Integrated Design & Process Science
Semantics of petri nets: a comparison
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
Complete Process Semantics of Petri Nets
Fundamenta Informaticae
On synchronicity and concurrency in Petri nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
A Generic Approach to Connector Architectures Part II: Instantiation to Petri Nets and CSP
Fundamenta Informaticae
Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
Complete Process Semantics of Petri Nets
Fundamenta Informaticae
Hi-index | 0.00 |
"Petri nets are monoids" is the title and the central idea of the paper [7]. It provides an algebraic approach to define both nets and their processes as terms. A crucial assumption for this concept is that arbitrary concurrent composition of processes is defined, which holds true for place/transition Petri nets where places can hold arbitrarily many tokens. A decade earlier, [10] presented a similar concept for elementary Petri nets, i.e. nets where no place can ever carry more than one token. Since markings of elementary Petri nets cannot be added arbitrarily, concurrent composition is defined as a partial operation. The present papers provides a general approach to process term semantics. Terms are equipped with the minimal necessary information to determine if two process terms can be composed concurrently. Applying the approach to elementary nets yields a concept very similar to the one in [10]. The second result of this paper states that the semantics based on process terms agrees with the classical partial-order process semantics for elementary net systems. More precisely, we provide a syntactic equivalence notion for process terms and a bijection from according equivalence classes of process terms to isomorphism classes of partially ordered processes. This result slightly generalizes a similar observation given in [11].