{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:15:49Z","timestamp":1649204149060},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,8,7]],"date-time":"2014-08-07T00:00:00Z","timestamp":1407369600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10878-014-9779-0","type":"journal-article","created":{"date-parts":[[2014,8,6]],"date-time":"2014-08-06T13:06:53Z","timestamp":1407330413000},"page":"308-329","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A structural transformation from p- $$\\pi $$ \u03c0 to MSVL"],"prefix":"10.1007","volume":"29","author":[{"given":"Ling","family":"Luo","sequence":"first","affiliation":[]},{"given":"Zhenhua","family":"Duan","sequence":"additional","affiliation":[]},{"given":"Cong","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Xiaobing","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,7]]},"reference":[{"key":"9779_CR1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J Bergstra","year":"1985","unstructured":"Bergstra J, Klop J (1985) Algebra of communicating processes with abstraction. J Theor Comput Sci 37:77\u2013121","journal-title":"J Theor Comput Sci"},{"key":"9779_CR2","unstructured":"Duan Z (1996) An extended interval temporal logic and a framing technique for temporal logic programming. Ph.D Thesis, University of Newcastle Upon Tyne"},{"key":"9779_CR3","volume-title":"Temporal logic and temporal logic programming","author":"Z Duan","year":"2006","unstructured":"Duan Z (2006) Temporal logic and temporal logic programming. Science Press, Beijing"},{"key":"9779_CR4","unstructured":"Duan Z, Tian C (2008) A unified model checking approach with projection temporal logic. In: Proceedings of ICFEM 2008. LNCS 5256, pp 167\u2013186"},{"key":"9779_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013344","DOI":"10.1007\/3-540-58216-9_48"},{"issue":"1","key":"9779_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s00236-007-0062-z","volume":"45","author":"Z Duan","year":"2008","unstructured":"Duan Z, Tian C, Zhang L (2008a) A decision procedure for propositional projection temporal logic with infinite models. Acta Inform 45(1):43\u201378","journal-title":"Acta Inform"},{"key":"9779_CR7","doi-asserted-by":"crossref","unstructured":"Duan Z, Yang X, Koutny M (2008b) Framed temporal logic programming. Sci Comput Programm 70(1):31\u201361","DOI":"10.1016\/j.scico.2007.09.001"},{"key":"9779_CR8","volume-title":"Communicating sequential processes","author":"C Hoare","year":"1985","unstructured":"Hoare C (1985) Communicating sequential processes. Prentice-Hall, London"},{"issue":"1","key":"9779_CR9","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"C Liu","year":"1973","unstructured":"Liu C, Layland J (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J Assoc Comput Mach 20(1):46\u201361","journal-title":"J Assoc Comput Mach"},{"key":"9779_CR10","first-page":"632","volume":"2012","author":"L Luo","year":"2012","unstructured":"Luo L, Duan Z (2012) An extended $$\\pi $$ \u03c0 -calculus. Proc CNSI 2012:632\u2013637","journal-title":"Proc CNSI"},{"key":"9779_CR11","unstructured":"Luo L, Duan Z (2013) A transformation from p- $$\\pi $$ \u03c0 to msvl. In: Proceedings of ICTAC 2013. LNCS 8049, pp 267\u2013281"},{"key":"9779_CR12","volume-title":"Lecture Notes in Computer Science 92","author":"R Milner","year":"1980","unstructured":"Milner R (1980) A calculus of communicating systems. Lecture Notes in Computer Science 92. Springer, Heidelberg"},{"key":"9779_CR13","volume-title":"Communicating and mobile systems: the $$\\pi $$ \u03c0","author":"R Milner","year":"1999","unstructured":"Milner R (1999) Communicating and mobile systems: the $$\\pi $$ \u03c0 -calculus. Cambridge University Press, Cambridge"},{"key":"9779_CR14","doi-asserted-by":"crossref","unstructured":"Milner R, Parrow J, Walker D (1992) A calculus of mobile processes. Inf Comput 100:1\u201377","DOI":"10.1016\/0890-5401(92)90008-4"},{"key":"9779_CR15","volume-title":"The $$\\pi $$ \u03c0","author":"D Sangiorgi","year":"2002","unstructured":"Sangiorgi D, Walker D (2002) The $$\\pi $$ \u03c0 -calculus: a theory of mobile processes. Cambridge University Press, Cambridge"},{"key":"9779_CR16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski A (1955) A lattice-theoretical fixpoint theorem and its applications. Pac J Math 5:285\u2013309","journal-title":"Pac J Math"},{"key":"9779_CR17","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The formal semantics of programming languages: an introduction","author":"G Winskel","year":"1993","unstructured":"Winskel G (1993) The formal semantics of programming languages: an introduction. Cambridge University Press, Cambridge"},{"key":"9779_CR18","doi-asserted-by":"crossref","unstructured":"Yang X, Duan Z (2008) Operational semantics of framed tempura. doi: 10.1016\/j.jlap.2008.08.001","DOI":"10.1016\/j.jlap.2008.08.001"},{"issue":"5","key":"9779_CR19","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1017\/S0960129510000241","volume":"20","author":"X Yang","year":"2010","unstructured":"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\u2013914","journal-title":"Math Struct Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9779-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9779-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9779-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,22]],"date-time":"2020-08-22T23:39:13Z","timestamp":1598139553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9779-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,7]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9779"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9779-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,7]]}}}