Introduction to concurrency theory. Transition systems and CCS

DOI10.1007/978-3-319-21491-7zbMath1333.68001OpenAlexW2483867491MaRDI QIDQ897107

Cristian Versari, Roberto Gorrieri

Publication date: 16 December 2015

Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21491-7

zbMATH Keywords

congruencelabelled transition systemsweak equivalenceprocess calculusbehavioral equivalencescalculus of communicating systemsstep semanticsbasic process algebrastrong prefixing

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (16)

Language Representability of Finite P/T Nets ⋮ Verification of finite-state machines: a distributed approach ⋮ Interleaving vs True Concurrency: Some Instructive Security Examples ⋮ A Study on Team Bisimulations for BPP Nets ⋮ Process calculi for biological processes ⋮ Symbolic Semantics for Multiparty Interactions in the Link-Calculus ⋮ Formally sound implementations of security protocols with JavaSPI ⋮ Unnamed Item ⋮ Team equivalences for finite-state machines with silent moves ⋮ Unique solutions of contractions, CCS, and their HOL formalisation ⋮ A constraint-based language for multiparty interactions ⋮ Team bisimilarity, and its associated modal logic, for BPP nets ⋮ Causal Semantics for BPP Nets with Silent Moves ⋮ A calculus of concurrent graph-rewriting processes ⋮ A study on team bisimulation and H-team bisimulation for BPP nets ⋮ Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves

Uses Software

• LOTOS
• LOTOSphere
• Concurrency Workbench

This page was built for publication: Introduction to concurrency theory. Transition systems and CCS