Abstract
This paper presents a structural transformation approach from p-\(\pi \) processes to MSVL programs. To this end, channel and communication primitives are firstly defined in MSVL. Further, based on these definitions, a mapping function \(\mathcal{F }\) which transforms bounded p-\(\pi \) processes into MSVL programs is formalized. Moreover, the soundness of the transformation is proved. By the transformation, p-\(\pi \) can provide a mechanism to model, simulate and verify concurrent time-dependent systems by means of the techniques of MSVL. Finally, a case study is given to illustrate how the transformation can be used in practice.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bergstra J, Klop J (1985) Algebra of communicating processes with abstraction. J Theor Comput Sci 37:77–121
Duan Z (1996) An extended interval temporal logic and a framing technique for temporal logic programming. Ph.D Thesis, University of Newcastle Upon Tyne
Duan Z (2006) Temporal logic and temporal logic programming. Science Press, Beijing
Duan Z, Tian C (2008) A unified model checking approach with projection temporal logic. In: Proceedings of ICFEM 2008. LNCS 5256, pp 167–186
Duan Z, Koutny M, Holt C (1994) Projection in temporal logic programming. In: Proceedings of logic programming and automatic reasoning. LNAI 822, Springer, pp 333–344
Duan Z, Tian C, Zhang L (2008a) A decision procedure for propositional projection temporal logic with infinite models. Acta Inform 45(1):43–78
Duan Z, Yang X, Koutny M (2008b) Framed temporal logic programming. Sci Comput Programm 70(1):31–61
Hoare C (1985) Communicating sequential processes. Prentice-Hall, London
Liu C, Layland J (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J Assoc Comput Mach 20(1):46–61
Luo L, Duan Z (2012) An extended \(\pi \)-calculus. Proc CNSI 2012:632–637
Luo L, Duan Z (2013) A transformation from p-\(\pi \) to msvl. In: Proceedings of ICTAC 2013. LNCS 8049, pp 267–281
Milner R (1980) A calculus of communicating systems. Lecture Notes in Computer Science 92. Springer, Heidelberg
Milner R (1999) Communicating and mobile systems: the \(\pi \)-calculus. Cambridge University Press, Cambridge
Milner R, Parrow J, Walker D (1992) A calculus of mobile processes. Inf Comput 100:1–77
Sangiorgi D, Walker D (2002) The \(\pi \)-calculus: a theory of mobile processes. Cambridge University Press, Cambridge
Tarski A (1955) A lattice-theoretical fixpoint theorem and its applications. Pac J Math 5:285–309
Winskel G (1993) The formal semantics of programming languages: an introduction. Cambridge University Press, Cambridge
Yang X, Duan Z (2008) Operational semantics of framed tempura. doi:10.1016/j.jlap.2008.08.001
Yang X, Duan Z, Ma Q (2010) Automatic verification of finite state concurrent system using temporal logic specification. Math Struct Comput Sci 20(5):865–914
Acknowledgments
This research is supported by the National Program on Key Basic Research Project of China (973 Program) Grant no. 2010CB328102, National Natural Science Foundation of China under Grant no. 61133001, 61202038, 61272117, 61272118, 61322202 and 91218301.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Luo, L., Duan, Z., Tian, C. et al. A structural transformation from p-\(\pi \) to MSVL . J Comb Optim 29, 308–329 (2015). https://doi.org/10.1007/s10878-014-9779-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-014-9779-0