On the implementation of concurrent calculi in net calculi: two case studies
From MaRDI portal
(Redirected from Publication:673785)
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
Cites work
- scientific article; zbMATH DE number 4191145 (Why is no real title available?)
- scientific article; zbMATH DE number 3821120 (Why is no real title available?)
- scientific article; zbMATH DE number 3825182 (Why is no real title available?)
- scientific article; zbMATH DE number 3896316 (Why is no real title available?)
- scientific article; zbMATH DE number 4094831 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 125888 (Why is no real title available?)
- scientific article; zbMATH DE number 3596235 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 4119615 (Why is no real title available?)
- scientific article; zbMATH DE number 4119653 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- A complete inference system for a class of regular behaviours
- A distributed operational semantics of CCS based on condition/event systems
- A partial ordering semantics for CCS
- A\(^ 2\)CCS: Atomic actions for CCS
- An algebraic view of interleaving and distributed operational semantics for CCS
- Equational type logic
- Finite Petri nets as models for recursive causal behaviour
- Finite representations of CCS and TCSP programs by automata and Petri nets
- Nets, Terms and Formulas
- Petri nets are monoids
- Petri nets, algebras, morphisms, and compositionality
- Sequential and concurrent behaviour in Petri net theory
- The chemical abstract machine
- The non-sequential behaviour of Petri nets
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
- scientific article; zbMATH DE number 4018372 (Why is no real title available?)
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
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)