The Decidability of the Reachability Problem for CCS!

DOI10.1007/978-3-642-23217-6_25MaRDI QIDQ3090842zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1500528
• scientific article; zbMATH DE number 1231669
• Some decidable results on reachability of solvable systems
• Proving finiteness of CCS processes by non-standard semantics
• Decidability of the reachability problem for pushdown relational automata
• Decidability of infinite-state timed CCP processes and first-order LTL
• Satisfiability of \(\mathrm{CTL}^{*}\) with constraints
• Representing CCS programs by finite predicate-transition nets
• Decidability of reachability for disjoint union of term rewriting systems

Cites work

• Automata, Languages and Programming
• CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence
• CONCUR 2004 - Concurrency Theory
• Decidability of behavioral equivalences in process calculi with name scoping
• Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Foundations of Software Science and Computation Structures
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1296290 (Why is no real title available?)
• scientific article; zbMATH DE number 2038705 (Why is no real title available?)
• On the expressive power of recursion, replication and iteration in process calculi
• On the Expressive Power of Restriction and Priorities in CCS with Replication
• On the expressiveness of interaction
• Process rewrite systems.
• Spatial and Behavioral Types in the Pi-Calculus
• The Decidability of the Reachability Problem for CCS!

Cited in

(6)

• On hierarchical communication topologies in the -calculus
• The Decidability of the Reachability Problem for CCS!
• scientific article; zbMATH DE number 5999552 (Why is no real title available?)
• CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence
• When Is Reachability Intrinsically Decidable?
• On the Expressive Power of Restriction and Priorities in CCS with Replication

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

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