Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/simulation-based-minimization-F9skHZX9g8
References (23)
-
Zhenhua Duan, Cong Tian (2019)
Model Checking -
C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, S. Bensalem (1995)
Property preserving abstractions for the verification of concurrent systemsFormal Methods in System Design, 6
-
A. Bouajjani, Jean-Claude Fernandez, N. Halbwachs (1990)
Minimal Model Generation -
A. Aziz, T. Shiple, V. Singhal (1994)
Formula-Dependent Equivalence for Compositional CTL Model CheckingFormal Methods in System Design, 21
-
M. Henzinger, T. Henzinger, P. Kopke (1995)
Computing simulations on finite and infinite graphsProceedings of IEEE 36th Annual Foundations of Computer Science
-
Adnan Aziz, V. Singhal, G. Swamy, R. Brayton (1994)
Minimizing interacting finite state machines: a compositional approach to language containmentProceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors
-
E. Clarke, E. Emerson (1981)
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic -
(2000)
Technion -Computer Science Department -Technical Report CS -
B. Bloom, R. Paige (1995)
Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation ProblemSci. Comput. Program., 24
-
A. Aziz, V. Singhal, G. Swamy, R. Brayton (1994)
Minimizing Interacting Finite State Machines: a Compositional Approach to Language Containment -
Edmund Clarke, E. Emerson, Joseph Sifakis (2009)
Model checkingCommunications of the ACM, 52
-
A. Bouali, R. Simone (1992)
Symbolic Bisimulation Minimisation -
D. Park (1981)
Concurrency and Automata on Infinite Sequences -
D. Dams, R. Gerth, O. Grumberg (1997)
Abstract interpretation of reactive systemsACM Trans. Program. Lang. Syst., 19
-
Grumberg -
Kathi Fisler, Moshe Vardi (1998)
Bisimulation Minimization in an Automata-Theoretic Verification Framework -
R. Milner (1971)
An Algebraic Definition of Simulation Between Programs -
Doron Bustan, O. Grumberg (2000)
Simulation Based Minimization -
A. Kucera, Richard Mayr (2002)
Simulation Preorder over Simple Process AlgebrasInf. Comput., 173
-
David Lee, M. Yannakakis (1992)
Online minimization of transition systems (extended abstract) -
O. Grumberg, D. Long (1991)
Model checking and modular verificationACM Trans. Program. Lang. Syst., 16
-
(2003)
ACM Transactions on Computational Logic -
(2001)
Received April
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2003 by ACM Inc.
- ISSN
- 1529-3785
- DOI
- 10.1145/635499.635502
- Publisher site
- See Article on Publisher Site
Abstract
We present a minimization algorithm that receives a Kripke structure M and returns the smallest structure that is simulation equivalent to M . The simulation equivalence relation is weaker than bisimulation but stronger than the simulation preorder. It strongly preserves ACTL and LTL (as sublogics of ACTL*).We show that every structure M has a unique-up-to-isomorphism reduced structure that is simulation equivalent to M and smallest in size. Our Minimizing Algorithm constructs this reduced structure. It first constructs the quotient structure for M , then eliminates transitions to little brothers, and finally deletes unreachable states.Since the first step of the algorithm is based on the simulation preorder over M , it has maximal space requirements. To reduce them, we present the Partitioning Algorithm, which constructs the quotient structure for M without ever building the simulation preorder. The Partitioning Algorithm has improved space complexity, but its time complexity might have worse.
Journal
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Apr 1, 2003