Finite representations of CCS and TCSP programs by automata and Petri nets
Finite representations of CCS and TCSP programs by automata and Petri nets
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Information and Computation - Special issue on EXPRESS 1997
Communication and Concurrency
Checking Regular Properties of Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Distributed Conflicts in Communicating Systems
ECOOP '94 Selected papers from the ECOOP'94 Workshop on Models and Languages for Coordination of Parallelism and Distribution, Object-Based Models and Languages for Concurrent Systems
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
An algorithm for the general Petri net reachability problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Spatial and Behavioral Types in the Pi-Calculus
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
On the Expressive Power of Restriction and Priorities in CCS with Replication
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On the expressive power of recursion, replication and iteration in process calculi
Mathematical Structures in Computer Science
On the expressiveness of interaction
Theoretical Computer Science
Replication vs. recursive definitions in channel based calculi
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
CCS with replication in the Chomsky hierarchy: the expressive power of divergence
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Reachability of hennessy-milner properties for weakly extended PRS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Decidability of behavioral equivalences in process calculi with name scoping
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
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.