2011 | OriginalPaper | Chapter
The Decidability of the Reachability Problem for CCS!
Author : Chaodong He
Published in: CONCUR 2011 – Concurrency Theory
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
CCS
!
is a variant of CCS in which infinite behaviors are defined by the replication operator. We show that the reachability problem for CCS
!
is decidable by a reduction to the same problem for Petri Nets.