An algebraic semantics for hierarchical P/T nets

DOI10.1007/3-540-60029-9_33zbMath1496.68214OpenAlexW1832869869MaRDI QIDQ5096359

Twan Basten, Marc Voorhoeve

Publication date: 16 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60029-9_33

zbMATH Keywords

verificationprocess algebraabstractionplace/transition netstop-down designhierarchical Petri nets

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

An algebraic semantics for hierarchical P/T nets

Cites Work

• A distributed operational semantics of CCS based on condition/event systems
• A calculus of communicating systems
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Process Algebra
• Algebraic Specification of Communication Protocols
• An algebraic semantics for hierarchical P/T nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item