Article

Free access

Online minimization of transition systems (extended abstract)

Authors:

Mihalis YannakakisAuthors Info & Claims

STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing

Pages 264 - 274

https://doi.org/10.1145/129712.129738

Published: 01 July 1992 Publication History

Abstract

We are given a transition system implicitly through a compact representation and wish to perform simultaneously reachability analysis and minimization without constructing first the whole system graph. We present an algorithm for this problem that applies to general systems, provided we have appropriate primitive operations for manipulating blocks of states and we can determine termination; the number of operations needed to construct the minimal reachable graph is quadratic in the size of this graph. We specialize the method to obtain efficient algorithms for extended finite state machines that apply separable affine transformations on the variables.

References

[1]

Alur, R., Courcoubetis, C., and Dill, D. {1990}. Model Checking for Real Time Systems, in Proc. 5th IEEE LICS.

[2]

Bouajjani, A., Fernandez, J-C., and Halbwachs, N. {1990}. Minimal Model Generation, in Proc. 2nd Workshop on Computer-Aided Verification, DIMACS Series Vol. 3, ACM- AMS, pp. 85-91.

Digital Library

[3]

Bouajjani, A., Fernandez, J-C., Halbwachs, N., Raymond, P. and Rat~l, C. {1991}. Minimal State Graph Generation, IMAG Grenoble Preprint.

[4]

Bryant, R. E. {1986}. Graph-based Algorithms for Boolean Function Manipulation, in IEEE Trans. on Computers, vol. 35.

Digital Library

[5]

Budkowski, S. and Dembinski, P. {1987}. An Introduction to Estell~: a Specification Language for Distributed Systems, in Computer Networks and ISDN Systems 14, pp. 3-23.

Digital Library

[6]

Burch, J, R., Clarke, E. M., McMillan, K. L., Dill, D. L., and Hwang, L. J. {1990}. Symbolic Model Checking: 102o States and Beyond, in Proc. 5th IEEE LICS, pp. 428-439.

[7]

Clarke, E.M., Emerson, E.A., and Sistla, A.P. {1986}. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications, in ACM Trans. on Prog. Lang. and Sys., vol. 8, pp. 244-263.

Digital Library

[8]

Cohen, E. and Meggido, N. {1991}. Improved Algorithms for Linear Inequalities with Two Variables per inequality, in Proc. 23rd Annual ACM Symp. on Theory of Computing, pp. 145- 155.

Digital Library

[9]

Coudert, O., Berthet, C., and Madre, J. C. {1989}. Verification of Synchronous Sequential Machines Based on Symbolic Execution, in Proc. Intl. Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407, Springer Verlag.

Digital Library

[10]

Courcoubetis, C., Vardi, M., Wolper, P. and Yannakakis, M. {1990}. Memory Efficient Algorithms for the Verification of Temporal Properties, in Proc. 2nd Workshop on Computer-Aided Verification, DIMACS Series Vol. 3, ACM-AMS, pp. 207-218.

Digital Library

[11]

Graf, S. and Steffen B. {1991}. Compositional Minimization of Finite State Systems, in Proc. 2nd Workshop on Computer-Aided Verification, DIMACS Series Vol. 3, ACM-AMS, pp. 57-73.

Digital Library

[12]

Hochbaum, D.S. and Naor, J. {1991}. Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality, manuscript.

[13]

Holzmann, G. J. {1988}. An Improved Protocol Reachability Analysis, in Software, Practice and Experience, vol. 18, pp. 137-161.

Digital Library

[14]

Holzmann, G. J. {1991}. Design and Validation of Protocols, Prentice-Hall, Inc., Englewood Cliffs, New Jersey.

Digital Library

[15]

Hopcroft, J. E. {1971}. An n log n Algorithm for Minimizing States in a Finite Automaton, in Theory of Machines and Computations, Z. Kohavi and A. Paz (eds.), pp. 189-196, Academic Press, New York.

[16]

Jard, C. and Jeron, T. {1989}. On-line Modelchecking for Finite Linear Temporal Logic Specifications, in Proc. Intl. Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407, Springer Verlag, pp. 189-196.

Digital Library

[17]

Kanellakis, P. and Smolka, S. {1983}. CCS Expressions, Finite State Processes and Three Problems of Equivalence, in Information and Comlmtation, vol. 86, pp. 43-68.

Digital Library

[18]

Logical Link Control {1989}. International Standard ISO 8802-2, IEEE Std. 802.2, The Institute of Electrical and Electronics Engineers, Inc.

[19]

Paige, R. and Tarjan, R. {1987}. Three Partition Refinement Algorithms, in SlAM J. on Computing, vol. 16, pp. 973-989.

Digital Library

[20]

Pnueli, A. {1986}, Applications of Temporal Logic to the Specification and Verification of Reactive Systems: a Survey of Current Trends, in Current Trends in Concurrency, LNCS 224, Springer Verlag, pp. 510-584.

Digital Library

[21]

Sidhu, D. P. and Leung, T.-K. {1989}. Formal Methods for Protocol Testing: A Detailed Study, in IEEE Trans. on Soft. Eng., vol 15, pp. 413-426.

Digital Library

[22]

Sifakis, J. {1982}. A Unified Approach for Studying the Properties of Transition Systems, in Theoretical Computer Science3.

[23]

Vardi, M. Y. and Wolper, P. {1986}. An Automata-Theoretic Approach to Automatic Program Verification, in Proc. LICS, pp. 322- 331.

[24]

West, C. H. {1978} Generalized Technique for Communication Protocol Validation, in IBM J. Res. andDevel., vol. 22, pp. 393-404.

Digital Library

[25]

Yannakakis, M. and Le#, D. {1991}. Testing Finite State Machines, in Proc. of the 23rd Annual ACM Symposium on Theory of Computing, pp. 476-485.

Digital Library

Cited By

Ganty PManini NRanzato F(2024)Computing Reachable Simulations on Transition SystemsReachability Problems10.1007/978-3-031-72621-7_3(21-37)Online publication date: 18-Sep-2024
https://doi.org/10.1007/978-3-031-72621-7_3
Abate AGiacobbe MSchnitzer Y(2024)Bisimulation LearningComputer Aided Verification10.1007/978-3-031-65633-0_8(161-183)Online publication date: 26-Jul-2024
https://doi.org/10.1007/978-3-031-65633-0_8
Gleizer GMadnani KMazo Jr. MBartocci EPutot S(2022)A Simpler Alternative: Minimizing Transition Systems Modulo Alternating Simulation EquivalenceProceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control10.1145/3501710.3519534(1-11)Online publication date: 4-May-2022
https://dl.acm.org/doi/10.1145/3501710.3519534
Show More Cited By

Index Terms

Online minimization of transition systems (extended abstract)
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Fault Collapsing for Transition Faults Using Extended Transition Faults
ETS '06: Proceedings of the Eleventh IEEE European Test Symposium

e present a fault collapsing procedure for transition faults based on fault dominance relations. The effectiveness of the procedure is enhanced by introducing what we call extended transition faults. A standard transition fault involves a single line ...
Crossing minimization in extended level drawings of graphs

The most popular method of drawing directed graphs is to place vertices on a set of horizontal or concentric levels, known as level drawings. Level drawings are well studied in Graph Drawing due to their strong application for the visualization of ...
Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
Abstract
A transition in a graph is defined as a pair of adjacent edges. A transition system of an Eulerian graph refers to a set of partitions such that for each vertex of the graph, there corresponds to a partition of the set of edges ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing

July 1992

794 pages

ISBN:0897915119

DOI:10.1145/129712

Chairmen:
Rao Kosaraju
Johns Hopkins Univ., Baltimore, MD
,
Mike Fellows
Univ. of Victoria, Victoria, BC, Canada
,
Avi Wigderson
Hebrew University; Princeton Univ., Princeton, NJ
,
John Ellis
Univ. of Victoria, Victoria, BC, Canada

Copyright © 1992 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC92

Sponsor:

SIGACT

STOC92: 24th Annual ACM Symposium on the Theory of Computing 1992

May 4 - 6, 1992

British Columbia, Victoria, Canada

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

102
Total Citations
View Citations
1,043
Total Downloads

Downloads (Last 12 months)142
Downloads (Last 6 weeks)10

Reflects downloads up to 21 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ganty PManini NRanzato F(2024)Computing Reachable Simulations on Transition SystemsReachability Problems10.1007/978-3-031-72621-7_3(21-37)Online publication date: 18-Sep-2024
https://doi.org/10.1007/978-3-031-72621-7_3
Abate AGiacobbe MSchnitzer Y(2024)Bisimulation LearningComputer Aided Verification10.1007/978-3-031-65633-0_8(161-183)Online publication date: 26-Jul-2024
https://doi.org/10.1007/978-3-031-65633-0_8
Gleizer GMadnani KMazo Jr. MBartocci EPutot S(2022)A Simpler Alternative: Minimizing Transition Systems Modulo Alternating Simulation EquivalenceProceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control10.1145/3501710.3519534(1-11)Online publication date: 4-May-2022
https://dl.acm.org/doi/10.1145/3501710.3519534
Larsen KSchilling CSrba J(2022)Simulation Relations and Applications in Formal MethodsPrinciples of Systems Design10.1007/978-3-031-22337-2_13(272-291)Online publication date: 29-Dec-2022
https://doi.org/10.1007/978-3-031-22337-2_13
Kumazawa TTakimoto MKambayashi Y(2020)A Survey on the Applications of Swarm Intelligence to Software VerificationHandbook of Research on Fireworks Algorithms and Swarm Intelligence10.4018/978-1-7998-1659-1.ch017(376-398)Online publication date: 2020
https://doi.org/10.4018/978-1-7998-1659-1.ch017
Pirron MZufferey DStanley-Marbell P(2020)Automated Controller and Sensor Configuration Synthesis Using Dimensional AnalysisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2020.301304439:11(3227-3238)Online publication date: Nov-2020
https://doi.org/10.1109/TCAD.2020.3013044
Prabhakar PLiu JMurray R(2018)Simulations and bisimulations for analysis of stability with respect to inputs of hybrid systemsDiscrete Event Dynamic Systems10.1007/s10626-017-0262-928:3(349-374)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1007/s10626-017-0262-9
Neele TWillemse TGroote J(2018)Solving Parameterised Boolean Equation Systems with Infinite Data Through QuotientingFormal Aspects of Component Software10.1007/978-3-030-02146-7_11(216-236)Online publication date: 5-Oct-2018
https://doi.org/10.1007/978-3-030-02146-7_11
Yao JWang ZYin XShi XLi YLi C(2017)Testing Black-Box SDN Applications with Formal Behavior Models2017 IEEE 25th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)10.1109/MASCOTS.2017.20(110-120)Online publication date: Sep-2017
https://doi.org/10.1109/MASCOTS.2017.20
Chonev VOuaknine JWorrell JIndyk P(2015)The polyhedron-hitting problemProceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/2722129.2722193(940-956)Online publication date: 4-Jan-2015
https://dl.acm.org/doi/10.5555/2722129.2722193
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents