Language representability of finite P/T nets

DOI10.1007/978-3-319-25527-9_17zbMATH Open1434.68325OpenAlexW2296205038MaRDI QIDQ3460873FDOQ3460873

Authors: 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

Recommendations

• A process calculus for expressing finite place/transition Petri nets
• scientific article; zbMATH DE number 4060688
• Representing CCS programs by finite predicate-transition nets
• scientific article; zbMATH DE number 3967922
• scientific article; zbMATH DE number 3896316

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• TOWARDS HIERARCHICAL DESCRIPTION OF SYSTEMS: A PROOF SYSTEM FOR STRONG PREFIXING
• Nets, Terms and Formulas
• Title not available (Why is that?)
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
• Process rewrite systems.
• A distributed operational semantics of CCS based on condition/event systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
• Axiomatizing the algebra of net computations and processes
• A\(^ 2\)CCS: Atomic actions for CCS
• Introduction to concurrency theory. Transition systems and CCS
• Language representability of finite P/T nets

Cited In (6)

• Finite Petri nets as models for recursive causal behaviour
• Pomset Languages of Finite Step Transition Systems
• Representing CCS programs by finite predicate-transition nets
• Title not available (Why is that?)
• A process calculus for expressing finite place/transition Petri nets
• Language representability of finite P/T nets

This page was built for publication: Language representability of finite P/T nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460873)