On the Weak Adequacy of Branching-Time Remporal Logic
暂无分享,去创建一个
[1] Matthew Hennessy,et al. The Power of the Future Perfect in Program Logics , 1985, Inf. Control..
[2] Jai Srinivasan,et al. Branching time temporal logic , 1988, REX Workshop.
[3] Jan A. Bergstra,et al. Process theory based on bisimulation semantics , 1988, REX Workshop.
[4] Robin Milner,et al. Algebraic laws for nondeterminism and concurrency , 1985, JACM.
[5] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[6] Amir Pnueli,et al. The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[7] Michael Thomas Sanderson,et al. Proof techniques for CCS , 1983 .
[8] Samson Abramsky,et al. Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..
[9] Jan A. Bergstra,et al. A convergence theorem in process algebra , 1982 .
[10] Joseph Y. Halpern,et al. "Sometimes" and "not never" revisited: on branching versus linear time (preliminary report) , 1983, POPL '83.
[11] Jan A. Bergstra,et al. On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..
[12] Stephen D. Brookes,et al. Behavioural Equivalence Relations Induced by Programming Logics , 1983, ICALP.
[13] William C. Rounds,et al. Connections Between Two Theories of Concurrency: Metric Spaces and Synchronization Trees , 1983, Inf. Control..
[14] Robin Milner,et al. A Modal Characterisation of Observable Machine-Behaviour , 1981, CAAP.
[15] Leslie Lamport,et al. "Sometime" is sometimes "not never": on the temporal logic of programs , 1980, POPL '80.
[16] Robin Milner,et al. Operational and Algebraic Semantics of Concurrent Processes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.