Publication:3805920
From MaRDI portal
zbMath0657.68066MaRDI QIDQ3805920
Ilaria Castellani, Gérard Boudol
Publication date: 1988
partial order semantics; concurrency; labelled transition systems; CCS; calculus of communicating systems
68Q55: Semantics in the theory of computing
68Q60: Specification and verification (program logics, model checking, etc.)
68Q65: Abstract data types; algebraic specification
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Models and logics for true concurrency., Recognizable languages in concurrency monoids, Location equivalence in a parametric setting, A partial ordering semantics for CCS, Automatic verification of distributed systems: the process algebra approach., Representation of computations in concurrent automata by dependence orders, A process algebra with distributed priorities, Non-interleaving semantics for mobile processes, A static view of localities, Comparing locality and causality based equivalences, Automatizing parametric reasoning on distributed concurrent systems, Labelled domains and automata with concurrency, A causal semantics for CCS via rewriting logic, Relating conflict-free stable transition and event models via redex families, Language-based performance prediction for distributed and mobile systems, Trace nets and process automata, \(\pi\)-calculus with noisy channels, Reversing algebraic process calculi, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
