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

DOI10.1007/978-3-540-76637-7_26zbMath1138.68038OpenAlexW2138915036MaRDI QIDQ3498448

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

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)

Related Items (4)

Declarative event based models of concurrency and refinement in psi-calculi ⋮ On Recursion, Replication and Scope Mechanisms in Process Calculi ⋮ On the Expressive Power of Restriction and Priorities in CCS with Replication ⋮ The Decidability of the Reachability Problem for CCS!

Cites Work

• CCS expressions, finite state processes, and three problems of equivalence
• A complete inference system for a class of regular behaviours
• Foundations of Software Science and Computation Structures
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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