Algebraic Characterization of Petri Net PomsetSemanticsHarro
نویسندگان
چکیده
Sets of pomsets are frequently used as a true-concurrency, linear-time semantics of Petri nets. For a Petri net N, let P(N), a set of pomsets, denote this pomset behaviour of N, and let P := fP(N) j N is a Petri netg denote the class of pomset behaviours of Petri nets, a generalization of L, the class of all Petri net languages. We present here an algebraic characterization for P, similar to the known algebraic characterizations for L.
منابع مشابه
Homogeneous Equations of Algebraic Petri Nets
Algebraic Petri nets are a formalism for modeling distributed systems and algorithms, describing control and data flow by combining Petri nets and algebraic specification. One way to specify correctness of an algebraic Petri net model N is to specify a linear equation E over the places of N based on term substitution, and coefficients from an abelian group G. Then, E is valid in N iff E is vali...
متن کاملAn algebraic characterization of independence of Petri net processes
The paper is concerned with processes of Petri nets. A partial operation on such processes is defined that allows one to concatenate processes whenever one process is a continuation of another. It is shown that for any Petri net as defined in the paper its set of processes equipped with this operation forms a category in which independence of processes can be characterized in a natural, purely ...
متن کاملSLAPN : A Tool for Slicing Algebraic Petri Nets
Algebraic Petri nets is a well suited formalism to represent the behavior of concurrent and distributed systems by handling complex data. For the analysis of systems modelled in Algebraic Petri nets, model checking and testing are used commonly. Petri nets slicing is getting an attention recently to improve the analysis of systems modelled in Petri nets or Algebraic Petri nets. This work is ori...
متن کاملFlexibility in Algebraic Nets
Algebraic Petri nets as deened by Reisig 15] lack a feature for modelling distributed network algorithms, viz. exible arcs. In this paper we equip algebraic Petri nets with exible arcs and we call the resulting extension algebraic system nets. We demonstrate that algebraic system nets are better suited for modelling distributed algorithms. Besides this practical motivation for introducing algeb...
متن کاملSiphons and Traps of Algebraic Petri Nets
We overview recent results concerning the symbolic veriication and calculation of siphons and traps for algebraic Petri nets and their relation to the net behavior.
متن کامل