scientific article; zbMATH DE number 2038705

zbMath1039.68082MaRDI QIDQ4449170

Nadia Busi, Gianluigi Zavattaro, Maurizio Gabbrielli

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190133.htm

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

Mathematics Subject Classification ID

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

Related Items (12)

On the Relationship between π-Calculus and Finite Place/Transition Petri Nets ⋮ Decidability issues for extended ping-pong protocols ⋮ CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence ⋮ Distinguishing and relating higher-order and first-order processes by expressiveness ⋮ Theory of interaction ⋮ On the expressiveness and decidability of higher-order process calculi ⋮ Towards a unified approach to encodability and separation results for process calculi ⋮ On the expressiveness of interaction ⋮ Typed event structures and the linear \(\pi \)-calculus ⋮ On the computational strength of pure ambient calculi ⋮ 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: