Compositional minimisation of finite state systems using interface specifications-Reference-Cited by-同舟云学术

Compositional minimisation of finite state systems using interface specifications

Published:1996-09 Issue:5 Volume:8 Page:607-616
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Graf Susanne¹,Steffen Bernhard²,Lüttgen Gerald²

Affiliation:

1. VERIMAG, Monbonnot, France

2. Fakultät für Mathematik und Informatik, Universität Passau, D-94030, Passau, Germany

Abstract

Abstract 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 specifications. The effect 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 specifications. However, its correctness is independent of the correctness of the interface specifications provided by the program designer.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01211911.pdf

Reference21 articles.

1. Bouajjani A. Fernandez J.-C. and Halbwachs N.: Minimal model generation. In Workshop on Automatic Verification '90 volume 531 of LNCS 1990.

2. Clarke E. Grumberg O. and Long D.: Model checking and abstraction. In Symp. Principles of Programming Languages '92 1992.

3. Clarke E. Long D. and McMillan K.: Compositional model checking. Proc. IEEE Symp. Logic in Computer Science pages 353–362 1989.

4. Cleaveland R. and Steffen B.: A preorder for partial process specifications. In Proceedings of CONCUR'90 Amsterdam (Netherlands) volume 458 of LNCS 1990.

5. Dams D. Grumberg O. and Gerth R.: Generation of reduced models for checking fragments of CTL. In Proceedings of the International Conference on Computer-Aided Verification (CAV'93) volume 697 of LNCS pages 479–490 1993.

Cited by 76 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decomposing monolithic processes in a process algebra with multi-actions;Journal of Logical and Algebraic Methods in Programming;2023-04

2. Compositional Model Checking of Consensus Protocols via Interaction-Preserving Abstraction;2022 41st International Symposium on Reliable Distributed Systems (SRDS);2022-09

3. Decompositional Branching Bisimulation Minimisation of Monolithic Processes;Formal Aspects of Component Software;2022

4. Equivalence Checking 40 Years After: A Review of Bisimulation Tools;Lecture Notes in Computer Science;2022

5. Decomposing Monolithic Processes in a Process Algebra with Multi-actions;Electronic Proceedings in Theoretical Computer Science;2021-10-02