### Citations

375 |
An n logn algorithm for minimizing states in a finite automaton. In:
- Hopcroft
- 1971
(Show Context)
Citation Context ...g equality of exit automata modulo a permutation of local states is the main challenge of the implementation. We propose a simple solution to this problem : a light modification of Hopcroft’algorithm =-=[8,7,9]-=-. 4.1. Strong Canonical Representation of Marked Shared Automata Basic structures for shared automaton representations are exit automata (SC-DFEA), shared automata, and marked shared automata. Figure ... |

366 |
Graph based algorithms for Boolean function manipulation
- Bryant
- 1986
(Show Context)
Citation Context ...k is the realisation of a BDD-like package because BDDs have proved these capability to take advantage of this aspect when using cache technique. Since Bryant’s original publication of BDD algorithms =-=[4]-=-, there has been a great deal of research in the area. One of the most powerful applications of BDDs has been symbolic model checking, used to formally verify digital circuits and other finite state s... |

74 | Fast: Fast acceleration of symbolic transition systems
- Bardin, Finkel, et al.
- 2003
(Show Context)
Citation Context ...tion Finite Automata are basic structures that appear in many areas of Computer Science and other disciplines. The emergence of new tools based on automata for the manipulation of infinite structures =-=[6,10,1,3]-=- makes improving the efficiency of automata packages a crucial challenge. The present work is motivated by model-checking problems. where most of the algorithms are based on fixed point computations t... |

50 | A performance study of BDD-based model checking. In
- Yang, Bryant, et al.
- 1998
(Show Context)
Citation Context ...problem verification: the backward symbolic state space exploration for Petri nets. Experimental results show the great benefit of the new canonical structure applied to this kind of problems. As BDD =-=[11]-=-, the main factor of this benefit is the computed cache. Indeed, the iterations of a state space exploration share many sub-problems. The rest of the paper is organised as follows. We first present ex... |

43 | On the construction of automata from linear arithmetic constraints
- Wolper, Boigelot
(Show Context)
Citation Context ...tion Finite Automata are basic structures that appear in many areas of Computer Science and other disciplines. The emergence of new tools based on automata for the manipulation of infinite structures =-=[6,10,1,3]-=- makes improving the efficiency of automata packages a crucial challenge. The present work is motivated by model-checking problems. where most of the algorithms are based on fixed point computations t... |

37 |
Describing an algorithm by Hopcroft
- Gries
- 1973
(Show Context)
Citation Context ...g equality of exit automata modulo a permutation of local states is the main challenge of the implementation. We propose a simple solution to this problem : a light modification of Hopcroft’algorithm =-=[8,7,9]-=-. 4.1. Strong Canonical Representation of Marked Shared Automata Basic structures for shared automaton representations are exit automata (SC-DFEA), shared automata, and marked shared automata. Figure ... |

34 | Mona 1.x: new techniques for ws1s and ws2s
- Elgaard, Klarlund, et al.
- 1998
(Show Context)
Citation Context ...tion Finite Automata are basic structures that appear in many areas of Computer Science and other disciplines. The emergence of new tools based on automata for the manipulation of infinite structures =-=[6,10,1,3]-=- makes improving the efficiency of automata packages a crucial challenge. The present work is motivated by model-checking problems. where most of the algorithms are based on fixed point computations t... |

33 | Algorithmic improvements in regular model checking. In:
- Abdulla, Jonsson, et al.
- 2003
(Show Context)
Citation Context |

16 |
Re-describing an algorithm by Hopcroft.
- Knuutila
- 2001
(Show Context)
Citation Context ...g equality of exit automata modulo a permutation of local states is the main challenge of the implementation. We propose a simple solution to this problem : a light modification of Hopcroft’algorithm =-=[8,7,9]-=-. 4.1. Strong Canonical Representation of Marked Shared Automata Basic structures for shared automaton representations are exit automata (SC-DFEA), shared automata, and marked shared automata. Figure ... |

13 | Efcient symbolic representations for arithmetic constraints in verication
- Bartzis, Bultan
- 2003
(Show Context)
Citation Context ...ng with 10 Jean-Michel Couvreur / A BDD-like Implementation of an Automata Package Réf. nbLocalStates nbOuputStates succ isFinal OZero 1 0 [[0,0]] [0] OOne 1 0 [[0,0]] [1] O1 4 1 [[-1,1],[3,3],[1,-1],=-=[2,0]-=-] [0,1,1,1] O2 5 2 [[-1,3],[2,0],[4,-1],[-2,1],[1,-2]] [0,1,1,1,1] Table 1. Exit automaton unique table Ref exitAutomaton bindFunction depth SZero OZero [] 0 SOne OOne [] 0 S1 O1 [Zero] 1 S2 O2 [(S1, ... |

11 |
Symbolic model checking: 10E20 states and beyond
- Burch, Clarke, et al.
- 1990
(Show Context)
Citation Context ... has been a great deal of research in the area. One of the most powerful applications of BDDs has been symbolic model checking, used to formally verify digital circuits and other finite state systems =-=[5]-=-. A BDD package is based on an efficient implementation of the if-then-else (ITE) operator. It uses essentially two principles: a hash table, called unique table, maintains a strong canonical form in ... |