Property Preserving Abstractions under Parallel Composition

We study property preserving transformations for reactive systems. A key idea is the use of ϱ-simulations which are simulations parametrized by a relation ϱ, relating the domains of two systems. We particularly address the problem of property preserving abstractions of composed programs. For a very general notion of parallel composition, we give the conditions under which simulation is a precongruence for parallel composition and we study which kind of global properties are preserved by these abstractions.

[1]  D. J. Walker,et al.  Bisimulation and Divergence , 1990, Inf. Comput..

[2]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[3]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

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

[5]  K. Mani Chandy.  Parallel program design , 1989 .

[6]  Joseph Sifakis,et al.  Property Preserving Simulations , 1992, CAV.

[7]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

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

[9]  Rob J. van Glabbeek,et al.  Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract) , 1989, IFIP Congress.

[10]  Orna Grumberg,et al.  Model checking and modular verification , 1991, TOPL.

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

[12]  R. Cleaveland,et al.  When is 'partial' adequate? A logic-based proof technique using partial specifications , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[13]  Alan J. Hu,et al.  Higher-Level Specification and Verification with BDDs , 1992, CAV.

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

[15]  Joseph Sifakis,et al.  Compilation and verification of LOTOS specifications , 1990, PSTV.

[16]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[17]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[18]  Kim G. Larsen,et al.  Compositional Proofs by Partial Specification of Processes , 1988, MFCS.

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

[20]  Thomas Filkorn.  Functional Extension of Symbolic Model Checking , 1991, CAV.