Efficient computation and representation of large reachability sets for composed automata (Q1610340)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient computation and representation of large reachability sets for composed automata |
scientific article |
Statements
Efficient computation and representation of large reachability sets for composed automata (English)
0 references
19 August 2002
0 references
automata networks
0 references
reachability analysis
0 references
Kronecker representation
0 references
ordered natural decision diagrams
0 references
