Automatic compositional minimization in CTL model checking
Massimiliano Chiodo,Thomas R. Shiple,Alberto Sangiovanni-Vincentelli,Robert K. Brayton +3 more
- 08 Nov 1992
- pp 172-178
15
TL;DR: A method for reducing the complexity of CTL model checking on a system of interacting finite state machines is described and the approach is assessed on real-world examples, and the method is demonstrated on a circuit.
read more
Abstract: We describe a method for reducing the complexity of CTL model checking on a system of interactingfinite state machines. The method consists essentially of reducing each component machine with respect to the property we want to verify. and then verifying the property on the composition of the reduced components. The procedure is fully automatic andproduces an exact result. We assess the potential of our approach on real-world examples, and demonstrate the method on a circuit.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Verification techniques for cache coherence protocols
Fong Pong,Michel Dubois +1 more
TL;DR: This article presents a comprehensive survey of various approaches for the verification of cache coherence protocols based on state enumeration, (symbolic model checking, and symbolic state models), and discusses the efficiency and the limitations of each technique in terms of memory and computation time.
118
BDD Variable Ordering for Interacting Finite State Machines
Adnan Aziz,Serdar Tasiran,Robert K. Brayton +2 more
- 06 Jun 1994
TL;DR: Algorithms for variable ordering for BDD representation of a system of interacting finite state machines are implemented in HSIS, a hierarchical synthesis and verification tool currently under development at Berkeley.
74
New Techniques for Efficient Verification with Implicitly Conjoined BDDs
Alan J. Hu,Gary York,David L. Dill +2 more
- 06 Jun 1994
TL;DR: This work proposes a new, more sophisticated heuristic to simplify and evaluate lists of implicitly conjoined BDDs and an exact termination test and demonstrates on examples that these more complex heuristics are reasonably efficient as well as allowing verification of examples that were previously intractable.
Verification of electronic systems
Alberto Sangiovanni-Vincentelli,Patrick C. McGeer,Alexander Saldanha +2 more
- 01 Jun 1996
TL;DR: A design methodology should on one hand put to good use all techniques and methods developed thus far for verification, from formal verification to simulation, from visualization to timing analysis, but should also have specific conceptual devices for dealing with correctness in the face of complexity.
Minimizing interacting finite state machines: a compositional approach to language containment
Adnan Aziz,Vigyan Singhal,Robert K. Brayton,Gitanjali Swamy +3 more
- 10 Oct 1994
TL;DR: This work addresses the problem of compositional minimization of collections of interacting finite state machines that arise in the context of formal verification of hardware designs by language containment by describing procedures that hierarchically minimize the system with respect to explicit and BDD representations.
40
References
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
Automatic verification of finite-state concurrent systems using temporal logic specifications
TL;DR: It is argued that this technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems.
Temporal and modal logic
E. Allen Emerson
- 02 Jan 1991
TL;DR: In this article, a multiaxis classification of temporal and modal logic is presented, and the formal syntax and semantics for two representative systems of propositional branching-time temporal logics are described.
3.1K
An n log n algorithm for minimizing states in a finite automaton
John E. Hopcroft
- 01 Jan 1971
TL;DR: An algorithm is given for minimizing the number of states in a finite automaton or for determining if two finite automata are equivalent and the running time is bounded by k n log n.
1K
Verification of concurrent programs, Part I: The temporal framework
Zohar Manna,Amir Pnueli +1 more
- 01 Jun 1981
TL;DR: The temporal formalism is introduced as a tool for reasoning about sequences of states and the set of interesting properties is classified into invariance (safety), eventuality (liveness, and precedence) properties.
353