Compositional Minimization of Finite State Systems Using Interface Speciications

In this paper we present a method for the compositional construction of the minimal transition system that represents the semantics of a given distributed system. Our aim is to control the state explosion caused by the interleavings of actions of communicating parallel components by reduction steps that exploit global communication constraints given in terms of interface speci cations. The e ect of the method, which is developed for bisimulation semantics here, depends on the structure of the distributed system under consideration, and the accuracy of the interface speci cations. However, its correctness does not: every \successful" construction is guaranteed to yield the desired minimal transition system, independent of the correctness of the interface speci cations provided by the program designer.

[1]  Amir Pnueli,et al.  In Transition From Global to Modular Temporal Reasoning about Programs , 1989, Logics and Models of Concurrent Systems.

[2]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, J. Log. Comput..

[3]  Rance Cleaveland,et al.  A Preorder for Partial Process Specifications , 1990, CONCUR.

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

[5]  Orna Grumberg,et al.  Network Grammars, Communication Behaviors and Automatic Verification , 1989, Automatic Verification Methods for Finite State Systems.

[6]  Bernhard Steeen,et al.  Finite Model Checking and Beyond , 1994 .

[7]  Nicolas Halbwachs,et al.  Minimal Model Generation , 1990, CAV.

[8]  Gary A. Kildall,et al.  A unified approach to global program optimization , 1973, POPL.

[9]  Edmund M. Clarke,et al.  Model checking and abstraction , 1994, TOPL.

[10]  Heiko Krumm.  Projections of the Reachability Graph and Environment Models , 1989, Automatic Verification Methods for Finite State Systems.

[11]  Robert P. Kurshan,et al.  A structural induction theorem for processes , 1989, PODC.

[12]  Orna Grumberg,et al.  The Modular Framework of Computer-Aided Verification , 1990, CAV.

[13]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[14]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[15]  Kim G. Larsen,et al.  A Constraint Oriented Proof Methodology Based on Modal Transition Systems , 1994, TACAS.

[16]  Rance Cleaveland,et al.  Testing-Based Abstractions for Value-Passing Systems , 1994, CONCUR.

[17]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[18]  Orna Grumberg,et al.  Generation of Reduced Models for Checking Fragments of CTL , 1993, CAV.

[19]  Edmund M. Clarke,et al.  Reasoning about networks with many identical finite-state processes , 1986, PODC '86.

[20]  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.

[21]  Joseph Sifakis,et al.  Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..

[22]  Edmund M. Clarke,et al.  Compositional model checking , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[23]  Pierre Wolper,et al.  Verifying Properties of Large Sets of Processes with Network Invariants , 1990, Automatic Verification Methods for Finite State Systems.

[24]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[25]  Bernhard Josko.  MCTL - An Extension of CTL for Modular Verification of Concurrent Systems , 1987, Temporal Logic in Specification.

[26]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

[27]  Pierre Wolper,et al.  Using partial orders for the efficient verification of deadlock freedom and safety properties , 1991, Formal Methods Syst. Des..

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