Equivalence transformations of PrT-Nets
There is a net theoretical system model called Predicate Transition Nets (PrT-Nets) that describes distributed systems as first-order dynamic structures. A single PrT-net can present a whole family of related systems in the same way as a set of logical formulae may describe a whole family of (static) systems — the class of its set-theoretical models.
In this note two PrT-nets are called equivalent if they describe the same family of systems. A list of formal transformations (re-writing rules) for PrT-nets that are consistent with equivalence is presented. For a non-trivial subclass of PrT-nets this set of rules is shown to characterize equivalence; it is also complete.
Key WordsHigher-level Petri nets predicate transition nets semantical equivalence rewriting rules
Unable to display preview. Download preview PDF.
- Albert, K.; Jensen, K.; Shapiro, R.: DESIGN/CPN — A Tool Package Supporting the Use of Coloured Petri Nets. Meta Software Corporation. Cambridge, MA (1989)Google Scholar
- Brauer, W.; Reisig, W.; Rozenberg, G. (eds.): Petri Nets: Central Models and Their Properties. Advances in Petri Nets 1986, Part I. Lecture Notes in Computer Science 254. Springer 1987Google Scholar
- Genrich, H.J.; Lautenbach, K.: System Modelling with High-Level Petri Nets. Theoretical Computer Science 13 (1981) 109–136Google Scholar
- Genrich, H.J.: Projections of CE Systems. In: Advances in Petri Nets 1985, Lecture Notes in Computer Science 222. Springer 1986Google Scholar
- Genrich, H.J.: Predicate/Transition Nets. In Google Scholar
- Jensen, K.: Coloured Petri Nets. In Google Scholar
- Shoenfield, J.R.: Mathematical Logic. Addison-Wesley 1967Google Scholar
- Thiagarajan, P.S.: Elementary Net Systems. In .Google Scholar