A distributed operational semantics of CCS based on condition/event systems

DOI10.1007/BF02915446zbMath0656.68061OpenAlexW2035959929MaRDI QIDQ1110338

Pierpaolo Degano, Ugo Montanari, Rocco De Nicola

Publication date: 1988

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02915446

zbMATH Keywords

operational semanticsparallelisminterleaving semanticsPetri netinference rulescalculus of communicating systemscondition/event system

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)

Related Items (43)

Compositional process semantics of Petri Boxes ⋮ Verification and comparison of transition systems ⋮ An algebraic characterization of observational equivalence ⋮ Asynchronous Traces and Open Petri Nets ⋮ Language Representability of Finite P/T Nets ⋮ When to Move to Transfer Nets ⋮ Concurrent bisimulations in Petri nets ⋮ TTL : a formalism to describe local and global properties of distributed systems ⋮ Partial ordering models for concurrency can be defined operationally ⋮ Architectural CCS ⋮ Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets ⋮ An algebraic view of interleaving and distributed operational semantics for CCS ⋮ An algebraic semantics for hierarchical P/T nets ⋮ Dynamic matrices and the cost analysis of concurrent programs ⋮ Process calculi for biological processes ⋮ Nested-unit Petri nets ⋮ Event structure semantics for multiparty sessions ⋮ Ugo Montanari and Concurrency Theory ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ A partial ordering semantics for CCS ⋮ Petri nets are monoids ⋮ Extensional Petri net ⋮ A multiset semantics for the pi-calculus with replication ⋮ Trapping mutual exclusion in the box calculus ⋮ Process versus unfolding semantics for Place/Transition Petri nets ⋮ On the implementation of concurrent calculi in net calculi: two case studies ⋮ The chemical abstract machine ⋮ Observing localities ⋮ Towards a Truly Concurrent Semantics for Reversible CCS ⋮ An algebra for process creation ⋮ Model-checking games for fixpoint logics with partial order models ⋮ Typed event structures and the linear \(\pi \)-calculus ⋮ Algebraic characterizations of trace and decorated trace equivalences over tree-like structures ⋮ Step failures semantics and a complete proof system ⋮ Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS ⋮ Pierpaolo Degano ⋮ A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems ⋮ A uniform approach to true-concurrency and interleaving semantics for Petri nets ⋮ Non-interleaving semantics for mobile processes ⋮ Zero-safe nets: Comparing the collective and individual token approaches. ⋮ The box algebra = Petri nets + process expressions ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic ⋮ The connection between an event structure semantics and an operational semantics for TCSP

Cites Work

• Algèbre de processus et synchronisation
• A partial ordering semantics for CCS
• Calculi for synchrony and asynchrony
• Concurrent histories: a basis for observing distributed systems
• Petri nets, algebras, morphisms, and compositionality
• A calculus of communicating systems
• Petri nets, event structures and domains. I
• Testing equivalences for processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A distributed operational semantics of CCS based on condition/event systems