A Model Checking Algorithm for π-Calculus Agents
暂无分享,去创建一个
[1] Joseph Y. Halpern,et al. “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.
[2] Chin-Laung Lei,et al. Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.
[3] Henry McGilton,et al. The JavaTM Language Environment , 1998 .
[4] Rocco De Nicola,et al. Action versus State based Logics for Transition Systems , 1990, Semantics of Systems of Concurrent Processes.
[5] Dexter Kozen,et al. RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .
[6] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[7] Marco Pistore,et al. An Automated Based Verification Environment for Mobile Processes , 1997, TACAS.
[8] Robin Milner,et al. A Calculus of Mobile Processes, II , 1992, Inf. Comput..
[9] David Walker,et al. Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..
[10] Marco Pistore,et al. Checking Bisimilarity for Finitary pi-Calculus , 1995, CONCUR.
[11] Davide Sangiorgi,et al. Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .
[12] David Walker,et al. Pi-Calculus Semantics of Object-Oriented Programming Languages , 1991, TACS.
[13] Mads Dam. Model Checking Mobile Processes , 1993, CONCUR.
[14] Ugo Montanari,et al. History-Dependent Automata , 1998 .
[15] Robin Milner,et al. A Calculus of Mobile Processes, II , 1992, Inf. Comput..
[16] Robin Milner,et al. Algebraic laws for nondeterminism and concurrency , 1985, JACM.