Automata, Languages and Programming

DOI10.1007/11523468zbMath1085.68594OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716865

Björn Victor, Joachim Parrow, Michael Baldamus

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (9)

Weak Bisimilarity Coalgebraically ⋮ Replacement freeness: a criterion for separating process calculi ⋮ Unnamed Item ⋮ Towards a unified approach to encodability and separation results for process calculi ⋮ Towards a Unified Approach to Encodability and Separation Results for Process Calculi ⋮ A taxonomy of process calculi for distribution and mobility ⋮ A Complete Symbolic Bisimilarity for an Extended Spi Calculus ⋮ The Attributed Pi-Calculus with Priorities ⋮ Expressiveness of Process Algebras

This page was built for publication: Automata, Languages and Programming