Language Representability of Finite P/T Nets

DOI10.1007/978-3-319-25527-9_17zbMath1434.68325OpenAlexW2296205038MaRDI QIDQ3460873

Roberto Gorrieri

Publication date: 8 January 2016

Published in: Programming Languages with Applications to Biology and Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25527-9_17

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Language Representability of Finite P/T Nets

Cites Work

• Introduction to concurrency theory. Transition systems and CCS
• A\(^ 2\)CCS: Atomic actions for CCS
• Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
• A distributed operational semantics of CCS based on condition/event systems
• Process rewrite systems.
• Axiomatizing the algebra of net computations and processes
• TOWARDS HIERARCHICAL DESCRIPTION OF SYSTEMS: A PROOF SYSTEM FOR STRONG PREFIXING
• Language Representability of Finite P/T Nets
• Nets, Terms and Formulas
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Language Representability of Finite P/T Nets