Process Algebra: An Algebraic Theory of Concurrency

DOI10.1007/978-3-642-03564-7_3zbMATH Open1256.68126OpenAlexW1664154384MaRDI QIDQ3642523

Wan Fokkink

Publication date: 5 November 2009

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03564-7_3

zbMATH Keywords

tutorial

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (19)

Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ Contradiction-Tolerant Process Algebra with Propositional Signals ⋮ A Lattice-Theoretic Model for an Algebra of Communicating Sequential Processes ⋮ Title not available (Why is that?) ⋮ Process Algebra for Parallel and Distributed Processing ⋮ Applying Formal Methods: Testing, Performance, and M/E-Commerce ⋮ Title not available (Why is that?) ⋮ Translating Hardware Process Algebras into Standard Process Algebras: Illustration with CHP and LOTOS ⋮ A process algebra with distributed priorities ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Simulation preorder over simple process algebras ⋮ Process algebra having inherent choice: revised semantics for concurrent systems ⋮ A truly concurrent semantics for a process algebra using resource pomsets ⋮ Special issue: Process algebra

This page was built for publication: Process Algebra: An Algebraic Theory of Concurrency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3642523)