On the Proof Method for Bisimulation (Extended Abstract)
作者： Davide Sangiorgi
DOI: 10.1007/3-540-60246-1_153
关键词:
摘要:
springer.com
sci-hub.st 参考文章(15)
Samson Abramsky, The lazy lambda calculus Research topics in functional programming. pp. 65- 116 ,(1990)
Didier Caucal, Graphes canoniques de graphes algébriques Theoretical Informatics and Applications. ,vol. 24, pp. 339- 352 ,(1990) , 10.1051/ITA/1990240403391
Robin Milner, Communication and Concurrency ,(1989)
Davide Sangiorgi, Lazy functions and mobile processes Proof, language, and interaction. pp. 691- 720 ,(2000)
Jan Friso Groote, Transition system specifications with negative premises international conference on concurrency theory. pp. 332- 341 ,(1990) , 10.1007/BFB0039069
Michele Boreale, Davide Sangiorgi, A fully abstract semantics for causality in the π-calculus STACS 95. pp. 243- 254 ,(1995) , 10.1007/3-540-59042-0_77
Davide Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms The University of Edinburgh. ,(1993)
S. Istrail, B. Bloom, A.R. Meyer, Bisimulation can't be traced. Preliminary report ,(1987)
Jan Friso Groote, Frits Vaandrager, Structured operational semantics and bisimulation as a congruence Information & Computation. ,vol. 100, pp. 202- 260 ,(1992) , 10.1016/0890-5401(92)90013-6
Robin Milner, Joachim Parrow, David Walker, A Calculus of Mobile Processes - Part II Information & Computation. ,vol. 100, pp. 41- 77 ,(1992) , 10.1016/0890-5401(92)90009-5