MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  UNIVERSITaT PASSAU Fakultat fur Mathematik und Informatik P Compositional Minimization of Finite State Systems Using Interface Speci cations

Download:
Download as a PDF
by Susanne Graf, Bernhard Ste En, Gerald Luttgen
http://www.icase.edu/~luettgen/publications/pdffiles/MIP9505.pdf
Add To MetaCart

Abstract:

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.

Citations

2762 Communication and Concurrency – Milner - 1989
2677 Communicating Sequential Processes – Hoare - 1978
2315 Graph-based algorithms for boolean function manipulation – Bryant - 1986
1440 Model Checking – Clarke, Grumberg, et al. - 2001
1069 A calculus of communicating systems – Milner - 1980
549 Model Checking and Abstraction – Clarke, Grumberg, et al.
113 A structural induction theorem for processes – Kurshan, McMillan - 1989
98 Verifying properties of large sets of processes with network invariants (extended abstract – Wolper, Lovinfosse - 1989
86 Reasoning about networks with many identical finitestate processes – Browne, Clarke, et al. - 1989
77 Compositionality through an operational semantics of contexts – Larsen - 1991
65 Minimal model generation – Bouajjani, Fernandez, et al.
43 Abstract Interpretation: a Uni ed Lattice Model for Static AnalysisofProgramsby Construction or Approximation of Fixpoints – Cousot, Cousot - 1977
42 transition from global to modular temporal reasoning about programs – In - 1984
37 Generation of reduced models for checking fragments of CT L – Dams, Gerth, et al. - 1979
29 A constraint oriented proof methodology – Larsen, Steffen, et al. - 1996
18 Network grammars, communication behaviours and automatic verification – Stadler, Grumberg - 1989
16 The modular framework of computer-aided verification: Motivation, solutions and evaluation criteria – Shurek, Grumberg
13 Bisimulation and divergence in CCS – Walker - 1988
11 Projections of the Reachability Graph and Environment Models – Krumm - 1989
10 Property preserving abstractions for the veri cation of concurrent systems – Loiseaux, Graf, et al. - 1995
9 A uni ed approach to global program optimization – Kildall - 1973
9 Monotone data ow analysis frameworks – Kam, Ullman - 1977
8 Using partial orders for the e cient veri cation of deadlock freedom and safety properties – Godefroid, Wolper - 1991
6 Automatic veri cation of nite state concurrent systems using temporal logic speci cations – Clarke, Emerson, et al. - 1986
4 Testing-based abstractions for value passing systems – Cleaveland, Riely - 1994
3 On-the- y veri cation with stubborn sets – Valmari - 1993
2 Ste en. The concurrency workbench – Cleaveland, Parrow, et al. - 1989
2 Ste en. A preorder for partial process speci cations – Cleaveland, B - 1990
2 Aldebaran: Un Systeme de Veri cation par Reduction de Processus Communicants – Fernandez - 1988
2 Program veri cation using compositional abstraction – Graf, Loiseaux - 1993
2 D.: Re Dependencies Improves Partial-Order Veri cation Methods – Godefroid, Pirottin - 1993
2 MCTL - an extension of CTL for modular veri cation of concurrent systems – Josko - 1987
2 Compositional proofs by partial speci cation of processes – Larsen, Thomsen - 1988
2 Kompositionelle Minimierung endlicher verteilter Systeme, Marz – Luttgen - 1994
2 Compositional checking of validity on nite state processes – Winskel - 1990
1 Ste en. A semantics based veri cation tool for nite state system – Cleaveland, Parrow, et al. - 1989
1 Ste en. When is \partial" adequate? A logic-based proof technique using partial speci cations – Cleaveland, B - 1990
1 An example of speci cation and veri cation in cesar `the analysis of concurrent systems – Schwartz, Sifakis - 1983
1 Cla en, and B. Ste en. Computer aided tool synthesis in META{Frame. GI/ITG Workshop on \Anwendung formaler Methoden beim Entwurf von Hardwaresystemen – Margaria, A - 1995
1 en. Finite model checking and beyond – Ste - 1994