On the implementation of concurrent calculi in net calculi: two case studies
DOI10.1016/0304-3975(94)00073-RzbMATH Open0873.68144OpenAlexW1988204590MaRDI QIDQ673785FDOQ673785
Authors: Roberto Gorrieri, Ugo Montanari
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00073-r
Recommendations
- Concurrent nets: a study of prefixing in process calculi
- Concurrent nets: a study of prefixing in process calculi
- Toward the concurrent implementation of computational systems
- Concurrent calculus (CC) and its properties
- A calculus for concurrent objects
- Publication:4721640
- A confluent calculus for concurrent constraint programming
- Network Conscious π-calculus: A Concurrent Semantics
- On implementations and semantics of a concurrent programming language
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) 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?)
- Title not available (Why is that?)
- The chemical abstract machine
- The non-sequential behaviour of Petri nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- A complete inference system for a class of regular behaviours
- Nets, Terms and Formulas
- Sequential and concurrent behaviour in Petri net theory
- Petri nets are monoids
- A distributed operational semantics of CCS based on condition/event systems
- Finite representations of CCS and TCSP programs by automata and Petri nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Petri nets, algebras, morphisms, and compositionality
- Finite Petri nets as models for recursive causal behaviour
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algebraic view of interleaving and distributed operational semantics for CCS
- Equational type logic
- A\(^ 2\)CCS: Atomic actions for CCS
- A partial ordering semantics for CCS
Cited In (10)
- The box algebra = Petri nets + process expressions
- Nested-unit Petri nets
- Tile formats for located and mobile systems.
- Concurrent nets: a study of prefixing in process calculi
- Concurrent nets: a study of prefixing in process calculi
- Ugo Montanari and Concurrency Theory
- Zero-safe nets: Comparing the collective and individual token approaches.
- Nested-unit Petri nets: a structural means to increase efficiency and scalability of verification on elementary nets
- Title not available (Why is that?)
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
Uses Software
This page was built for publication: On the implementation of concurrent calculi in net calculi: two case studies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673785)