The Decidability of the Reachability Problem for CCS!
暂无分享,去创建一个
[1] Yuxi Fu,et al. Decidability of Behavioral Equivalences in Process Calculi with Name Scoping , 2011, FSEN.
[2] Vojtech Rehák,et al. Reachability of Hennessy-Milner Properties for Weakly Extended PRS , 2005, FSTTCS.
[3] Vincent Danos,et al. Reversible Communicating Systems , 2004, CONCUR.
[4] Ian Stark,et al. Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.
[5] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[6] Richard Mayr. Process rewrite systems , 1997, EXPRESS.
[7] Faron Moller,et al. Checking Regular Properties of Petri Nets , 1995, CONCUR.
[8] Frank D. Valencia,et al. On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi , 2004, FoSSaCS.
[9] Robin Milner,et al. Communicating and mobile systems - the Pi-calculus , 1999 .
[10] Irène Guessarian,et al. Semantics of systems of concurrent processes : LITP Spring School on Theoretical Computer Science, La Roche Posay, France, April 23-27, 1990, proceedings , 1990 .
[11] Lucia Acciai,et al. Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types , 2009, ICALP.
[12] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[13] Brian Campbell,et al. Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.
[14] Marsha Chechik,et al. CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings , 2008, CONCUR.
[15] Insup Lee,et al. CONCUR '95: Concurrency Theory , 1995, Lecture Notes in Computer Science.
[16] Maurizio Gabbrielli,et al. Replication vs. Recursive Definitions in Channel Based Calculi , 2003, ICALP.
[17] Richard L. Tenney,et al. The decidability of the reachability problem for vector addition systems (Preliminary Version) , 1977, STOC '77.
[18] Maurizio Gabbrielli,et al. On the expressive power of recursion, replication and iteration in process calculi , 2009, Mathematical Structures in Computer Science.
[19] Maurizio Gabbrielli,et al. Comparing Recursion, Replication, and Iteration in Process Calculi , 2004, ICALP.
[20] Jean-Luc Lambert,et al. A Structure to Decide Reachability in Petri Nets , 1992, Theor. Comput. Sci..
[21] Ernst W. Mayr. An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..
[22] Dirk Taubner,et al. Finite Representations of CCS and TCSP Programs by Automata and Petri Nets , 1989, Lecture Notes in Computer Science.
[23] Lucia Acciai,et al. Spatial and behavioral types in the pi-calculus , 2010, Inf. Comput..
[24] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[25] S. Rao Kosaraju,et al. Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.
[26] Frank D. Valencia,et al. On the Expressive Power of Restriction and Priorities in CCS with Replication , 2009, FoSSaCS.
[27] Sundar Sarukkai,et al. FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings , 2005, FSTTCS.
[28] Frank D. Valencia,et al. CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence , 2007, APLAS.
[29] Ursula Goltz. CCS and Petri Nets , 1990, Semantics of Systems of Concurrent Processes.
[30] Roberto Gorrieri,et al. Distributed Conflicts in Communicating Systems , 1994, ECOOP Workshop.
[31] Yuxi Fu,et al. On the expressiveness of interaction , 2010, Theor. Comput. Sci..
[32] Davide Sangiorgi,et al. Communicating and Mobile Systems: the π-calculus, , 2000 .
[33] Vojtech Rehák,et al. Extended Process Rewrite Systems: Expressiveness and Reachability , 2004, CONCUR.