A formal definition of hierarchical predicate transition nets

DOI10.1007/3-540-61363-3_12zbMath1418.68144OpenAlexW1485288488MaRDI QIDQ4633163

Xudong He

Publication date: 2 May 2019

Published in: Application and Theory of Petri Nets 1996 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61363-3_12

zbMATH Keywords

algebraic specificationformal syntaxdata flow diagramsuper nodeport node

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Petri net modules in the transformation-based component framework ⋮ Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets ⋮ Nested-unit Petri nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri nets and algebraic specifications
• System modelling with high-level Petri nets
• Coloured Petri nets and the invariant-method
• Completing the temporal picture
• Models for reactivity

This page was built for publication: A formal definition of hierarchical predicate transition nets