Skip to Main content Skip to Navigation
Conference papers

PLACE_SUBST Transformation of P/T Petri Process Nets and Its Properties

Abstract : Petri nets is one of mathematical modeling languages for the description of all kind of parallel systems. Property-preserving Petri net process algebras (PPPA) were originally designed for the specification and verification of Petri net processes representing the manufacturing systems. PPPA does not need to verify the composition of Petri net processes because all their algebraic operators preserve the specified set of the properties. These original PPPA are generalized for the newly introduced class of the P/T Petri process nets (PTPN) in this article. The only one PLACE_SUBST transformation is defined for the class of PTPN and its chosen properties are presented. The PTPN can be with the support of the PLACE_SUBST transformation easily applied into the area of design, simulation and verification of multithreading programming systems executed in parallel or distributed environment. This fact is demonstrated on the simple example of the client-server distributed programming system.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, November 17, 2017 - 3:44:23 PM
Last modification on : Saturday, June 1, 2019 - 11:34:02 AM
Long-term archiving on: : Sunday, February 18, 2018 - 3:04:39 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License




Ivo Martiník. PLACE_SUBST Transformation of P/T Petri Process Nets and Its Properties. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. pp.504-515, ⟨10.1007/978-3-319-45378-1_45⟩. ⟨hal-01637481⟩



Record views


Files downloads