![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Decidability of Behavioral Equivalences in Process Calculi with Name Sco**
Local channels and their name sco** rules play a significant role in the study of the expressiveness of process calculi. The paper contributes to the understanding of the expressiveness in the context of CCS...
-
Chapter and Conference Paper
The Decidability of the Reachability Problem for CCS!
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.
-
Chapter and Conference Paper
Model Independent Order Relations for Processes
Semantic preorders between processes are usually applied in practice to model approximation or implementation relationships. For interactive models these preorders depend crucially on the observational behavio...