7 search results - page 1 / 2 » A BDD-Like Implementation of an Automata Package |
WIA
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
WIA
2000
Springer
13 years 8 months ago
2000
Springer
We have implemented a package that transforms concise algebraic descriptions of linear block codes into finite automata representations, and also generates decoders from such repre...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast...
ATVA
2005
Springer
13 years 10 months ago
2005
Springer
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
SIGADA
2007
Springer
13 years 10 months ago
2007
Springer
A system based on a hierarchical scheduler is a system in which the processor is shared between several collaborative schedulers. Such schedulers exist since 1960 and they are bec...