Efficient computation and representation of large reachability sets for composed automata (Q1610340)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1783545
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient computation and representation of large reachability sets for composed automata |
scientific article; zbMATH DE number 1783545 |
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
0.7576271891593933
0 references
0.7503650784492493
0 references
0.7462881207466125
0 references
0.7297618389129639
0 references
