Abstract
This chapter addresses a range of issues that arise when process algebras and Petri nets are combined; in particular, it focuses on compositionality of structure and behavior, on refinement, and on equivalence notions. A generic algebra of nets and process expressions is defined and equipped with two types of semantics: a Petri net semantics based on step sequences and causal partial orders, and a structural operational semantics based on a system of derivation rules. The main result states that these two semantics are equivalent. A concrete example of this algebraic framework is the Petri Box Calculus (PBC) which is used to convey the basic ideas contained in the chapter.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: Handbook of Process Algebra
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
