![]() |
Volumn 2, Issue 3, 1999, Pages 270-278
|
A minimized automaton representation of reachable states
a a |
Author keywords
Data compression; Finite automata; Model checking; OBDDs; Sharing trees; Spin; Verification
|
Indexed keywords
DETERMINISTIC FINITE AUTOMATA;
EXPECTED TIME;
EXPLICIT STATE;
MEMORY REQUIREMENTS;
MODEL CHECKER;
OBDDS;
SHARING TREES;
SPIN;
DATA COMPRESSION;
FINITE AUTOMATA;
VERIFICATION;
MODEL CHECKING;
|
EID: 84896857608
PISSN: 14332779
EISSN: 14332787
Source Type: Journal
DOI: 10.1007/s100090050034 Document Type: Article |
Times cited : (36)
|
References (10)
|