Abstract
Local channels and their name scoping 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 by studying the decidability issues of the bisimilarity/similarity checking problems. The strong bisimilarity for a pair of processes in the calculi with only static local channels is shown \(\Pi^{0}_{1}\)-complete. The strong bisimilarity between those processes and the finite state processes is proved decidable. The strong similarity between the finite state processes and the processes without name-passing capability is also shown decidable.
The work is supported by NSFC (60873034, 61033002).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aranda, J., Di Giusto, C., Nielsen, M., Valencia, F.: CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 383–398. Springer, Heidelberg (2007)
Aranda, J., Valencia, F.D., Versari, C.: On the Expressive Power of Restriction and Priorities in CCS with Replication. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 242–256. Springer, Heidelberg (2009)
Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on infinite structures. In: Handbook of Process Algebra, pp. 545–623 (2001)
Busi, N., Gabbrielli, M., Zavattaro, G.: Replication vs. Recursive Definitions in Channel Based Calculi. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 133–144. Springer, Heidelberg (2003)
Busi, N., Gabbrielli, M., Tennenholtz, M.: Comparing Recursion, Replication, and Iteration in Process Calculi. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 307–319. Springer, Heidelberg (2004)
Busi, N., Gabbrielli, M., Zavattaro, G.: On the expressive power of recursion, replication and iteration in process calculi. Mathematical Structures in Computer Science 19(6), 1191–1222 (2009)
Christensen, S., Hirshfeld, Y., Moller, F.: Decidable subsets of CCS. Comput. J. 37(4), 233–242 (1994)
Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere? Theor. Comput. Sci. 256(1-2), 63–92 (2001)
Fu, Y.: Theory of interaction (2010), http://basics.sjtu.edu.cn/~yuxi/
Fu, Y., Lu, H.: On the expressiveness of interaction. Theor. Comput. Sci. 411(11-13), 1387–1451 (2010)
Giambiagi, P., Schneider, G., Valencia, F.: On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 226–240. Springer, Heidelberg (2004)
Goltz, U.: CCS and Petri Nets. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469, pp. 334–357. Springer, Heidelberg (1990)
He, C., Fu, Y., Fu, H.: Decidability of behavioural equivalences in process calculi with name scoping (2010), http://basics.sjtu.edu.cn/~chaodong/
Jancar, P., Srba, J.: Undecidability of bisimilarity by defender’s forcing. J. ACM 55(1) (2008)
Jančar, P., Kučera, A., Mayr, R.: Deciding bisimulation-like equivalences with finite-state processes. Theor. Comput. Sci. 258(1-2), 409–433 (2001)
Jančar, P., Moller, F.: Checking Regular Properties of Petri Nets. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 348–362. Springer, Heidelberg (1995)
Jančar, P., Moller, F.: Techniques for Decidability and Undecidability of Bisimilarity. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 30–45. Springer, Heidelberg (1999)
Kučera, A., Jancar, P.: Equivalence-checking on infinite-state systems: Techniques and results. TPLP 6(3), 227–264 (2006)
Kučera, A., Mayr, R.: Why is simulation harder than bisimulation? In: Brim, L., Jančar, P., Křetínský, M., Kučera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 594–609. Springer, Heidelberg (2002)
Lanese, I., Pérez, J.A., Sangiorgi, D., Schmitt, A.: On the expressiveness and decidability of higher-order process calculi. In: LICS, pp. 145–155 (2008)
Mayr, R.: Process rewrite systems. Inf. Comput. 156(1-2), 264–286 (2000)
Milner, R.: Communication and concurrency. Prentice-Hall (1989)
Milner, R.: Communicating and Mobile Systems: the π-calculus. Cambridge University Press (1999)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Inf. Comput. 100(1), 1–77 (1992)
Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall (1967)
Sangiorgi, D., Walker, D.: PI-Calculus: A Theory of Mobile Processes. Cambridge University Press (2001)
Srba, J.: Roadmap of Infinite results. Formal Models and Semantics, vol. 2. World Scientific Publishing Co. (2004)
Taubner, D.A.: Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. LNCS, vol. 369. Springer, Heidelberg (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, C., Fu, Y., Fu, H. (2012). Decidability of Behavioral Equivalences in Process Calculi with Name Scoping. In: Arbab, F., Sirjani, M. (eds) Fundamentals of Software Engineering. FSEN 2011. Lecture Notes in Computer Science, vol 7141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29320-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-29320-7_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29319-1
Online ISBN: 978-3-642-29320-7
eBook Packages: Computer ScienceComputer Science (R0)