The Decidability of the Reachability Problem for CCS!

DOI10.1007/978-3-642-23217-6_25zbMath1343.68169OpenAlexW1821089671MaRDI QIDQ3090842

Chaodong He

Publication date: 2 September 2011

Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_25

Mathematics Subject Classification ID

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

Related Items (2)

On Hierarchical Communication Topologies in the $$\pi $$ -calculus ⋮ The Decidability of the Reachability Problem for CCS!

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the expressiveness of interaction
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Process rewrite systems.
• Decidability of Behavioral Equivalences in Process Calculi with Name Scoping
• The Decidability of the Reachability Problem for CCS!
• CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence
• Spatial and Behavioral Types in the Pi-Calculus
• On the Expressive Power of Restriction and Priorities in CCS with Replication
• Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
• On the expressive power of recursion, replication and iteration in process calculi
• Foundations of Software Science and Computation Structures
• CONCUR 2004 - Concurrency Theory
• Automata, Languages and Programming
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: The Decidability of the Reachability Problem for CCS!