Foundations of Software Science and Computation Structures

DOI10.1007/b95995zbMath1126.68500OpenAlexW3105029025MaRDI QIDQ5308453

Frank D. Valencia, Gerardo Schneider, Pablo Giambiagi

Publication date: 28 September 2007

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

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

Mathematics Subject Classification ID

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

Related Items (10)

Decidability issues for extended ping-pong protocols ⋮ CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence ⋮ Theory of interaction ⋮ On Recursion, Replication and Scope Mechanisms in Process Calculi ⋮ Replacement freeness: a criterion for separating process calculi ⋮ On the expressiveness of interaction ⋮ Typed event structures and the linear \(\pi \)-calculus ⋮ On the interactive power of higher-order processes extended with parameterization ⋮ On the Expressive Power of Restriction and Priorities in CCS with Replication ⋮ The Decidability of the Reachability Problem for CCS!

This page was built for publication: Foundations of Software Science and Computation Structures