Property Preserving Simulations

We study property preserving transformations for reactive systems. A key idea is the use of -simulations which are simulations parameterized by a Galois connection (ϕ, ψ), relating the lattices of properties of two systems.

[1]  Robin Milner,et al.  An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.

[2]  Raymond E. Miller,et al.  Homomorphisms between Models of Parallel Computation , 1982, J. Comput. Syst. Sci..

[3]  Martín Abadi,et al.  The Existence of Refinement Mappings , 1988, LICS.

[4]  Joseph Sifakis,et al.  Property Preserving Homomorphisms of Transition Systems , 1983, Logic of Programs.

[5]  Joseph Sifakis,et al.  A Unified Approach for Studying the Properties of Transition Systems , 1982, Theor. Comput. Sci..

[6]  Amir Pnueli.  The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[7]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[8]  Joseph Sifakis,et al.  A Modal Characterization of Observational Congruence on Finite Terms of CCS , 1986, Inf. Control..

[9]  Leslie Lamport,et al.  Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.

[10]  Zohar Manna,et al.  A hierarchy of temporal properties (invited paper, 1989) , 1990, PODC '90.

[11]  Robert P. Kurshan,et al.  Analysis of Discrete Event Coordination , 1989, REX Workshop.

[12]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[13]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[14]  Joseph Y. Halpern,et al.  "Sometimes" and "not never" revisited: on branching versus linear time (preliminary report) , 1983, POPL '83.

[15]  A. Prasad Sistla,et al.  Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach , 1983, POPL '83.

[16]  Patrick Cousot,et al.  Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation , 1992, PLILP.

[17]  Rocco De Nicola,et al.  Three logics for branching bisimulation , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[18]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

[19]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[20]  Pierre Wolper.  Temporal Logic Can Be More Expressive , 1983, Inf. Control..

[21]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[22]  Joseph Sifakis,et al.  Safety for Branching Time Semantics , 1991, ICALP.