A logig for the description of behaviours and properties of concurrent systems
暂无分享,去创建一个
[1] Rohit Parikh,et al. A Decision Procedure for the Propositional µ-Calculus , 1983, Logic of Programs.
[2] Dexter Kozen,et al. RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .
[3] A. Prasad Sistla,et al. Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach , 1983, POPL '83.
[4] Joseph Sifakis,et al. A Logic for the Description of Non-deterministic Programs and Their Properties , 1986, Inf. Control..
[5] S. Graf,et al. A Logic for the Specification and Proof of Controllable Processes of CCS , 1989, Logics and Models of Concurrent Systems.
[6] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.
[7] E. Allen Emerson,et al. The Propositional Mu-Calculus is Elementary , 1984, ICALP.
[8] Amir Pnueli,et al. Linear and Branching Structures in the Semantics and Logics of Reactive Systems , 1985, ICALP.
[9] Axel Poigné,et al. On Specifications, Theories, and Models with Higher Types , 1986, Inf. Control..
[10] Chin-Laung Lei,et al. Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.
[11] Robin Milner,et al. A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..
[12] Joseph Sifakis,et al. A Modal Characterization of Observational Congruence on Finite Terms of CCS , 1986, Inf. Control..
[13] Joseph Y. Halpern,et al. "Sometimes" and "not never" revisited: on branching versus linear time (preliminary report) , 1983, POPL '83.
[14] Joseph Sifakis,et al. Specification and Development of Reactive Systems - Response , 1986, IFIP Congress.