CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence

DOI10.1007/978-3-540-76637-7_26MaRDI QIDQ3498448zbMATH OpenOpenAlexFDO

Authors Jesús Aranda, Cinzia Di Giusto, Mogens Nielsen, Frank D. Valencia

Publication date 15 May 2008

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00201547/file/aplas07.pdf

Mathematics Subject Classification ID

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

Recommendations

• On the Expressive Power of Restriction and Priorities in CCS with Replication
• On the expressive power of recursion, replication and iteration in process calculi
• CCS(25,12) is Turing-complete
• Foundations of Software Science and Computation Structures
• The Decidability of the Reachability Problem for CCS!

Cites work

• A complete inference system for a class of regular behaviours
• Automata, Languages and Programming
• CCS expressions, finite state processes, and three problems of equivalence
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 5605072 (Why is no real title available?)
• 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?)
• scientific article; zbMATH DE number 1531624 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• The -calculus: A theory of mobile processes
• Verification on infinite structures.

Cited in

(5)

• Declarative event based models of concurrency and refinement in psi-calculi
• The Decidability of the Reachability Problem for CCS!
• On Recursion, Replication and Scope Mechanisms in Process Calculi
• On the Expressive Power of Restriction and Priorities in CCS with Replication
• CCS(25,12) is Turing-complete

This page was built for publication: CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence

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