scientific article

zbMath0657.68066MaRDI QIDQ3805920

Ilaria Castellani, Gérard Boudol

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

partial order semanticsconcurrencylabelled transition systemsCCScalculus of communicating systems

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) 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)

Related Items (39)

A static view of localities ⋮ Connections between a concrete and an abstract model of concurrent systems ⋮ Comparing locality and causality based equivalences ⋮ Automatizing parametric reasoning on distributed concurrent systems ⋮ Labelled domains and automata with concurrency ⋮ Trace nets and process automata ⋮ Reversing algebraic process calculi ⋮ Contextual equivalences in configuration structures and reversibility ⋮ Order algebras: a quantitative model of interaction ⋮ Read-write causality ⋮ Event structure semantics for multiparty sessions ⋮ Compositional Specification in Rewriting Logic ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ The correctness of concurrencies in (reversible) concurrent calculi ⋮ A partial ordering semantics for CCS ⋮ Extended transition systems for parametric bisimulation ⋮ From domains to automata with concurrency ⋮ A kleene theorem for recognizable languages over concurrency monoids ⋮ Recognizable languages in concurrency monoids ⋮ Location equivalence in a parametric setting ⋮ Causality for mobile processes ⋮ Automatic verification of distributed systems: the process algebra approach. ⋮ Realisability of pomsets ⋮ Making random choices invisible to the scheduler ⋮ Models and logics for true concurrency. ⋮ A calculus of branching processes ⋮ A parametric approach to localities ⋮ Proved trees ⋮ Representation of computations in concurrent automata by dependence orders ⋮ Egalitarian State-Transition Systems ⋮ A process algebra with distributed priorities ⋮ Non-interleaving semantics for mobile processes ⋮ Unnamed Item ⋮ \(\pi\)-calculus with noisy channels ⋮ Concurrencies in reversible concurrent calculi ⋮ Language-based performance prediction for distributed and mobile systems ⋮ A Chart Semantics for the Pi-Calculus ⋮ A causal semantics for CCS via rewriting logic ⋮ Relating conflict-free stable transition and event models via redex families

This page was built for publication: