Efficient computation and representation of large reachability sets for composed automata

Discrete Event Dynamic Systems: Theory and Applications

Volumn 12, Issue 3, 2002, Pages 265-286

  Buchholz, Peter ^a   Kemper, Peter ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Automata networks; Equivalence; Kronecker representation; Ordered natural decision diagrams; Reachability analysis

Indexed keywords

ALGORITHMS; GRAPH THEORY; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS; STATE SPACE METHODS; SYNCHRONIZATION;

AUTOMATA NETWORKS;

AUTOMATA THEORY;

EID: 0036644552     PISSN: 09246703     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015669415634     Document Type: Conference Paper

References (30)

1. A toolbox for functional and quantitative analysis of DEDS
2. Verification of hierarchical state/event systems using reusability and compositionality
3. M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages
4. Graph based algorithms for Boolean function manipulation
5. Exact performance equivalence - An equivalence relation for stochastic automata
6. Hierarchical structuring of superposed GSPNs
7. Structured analysis approaches for large Markov chains
8. Modular state level analysis of distributed systems - Techniques and tool support
9. Efficient computation and representation of large reachability sets for composed automata
10. 20 states and beyond
11. Storage alternatives for large structured state spaces
12. Automatic verification of finite state concurrent systems using temporal logic specifications
13. Formal methods: State of the art and future directions
14. The concurrency workbench: A semantics based tool for the verification of concurrent systems
15. Kronecker products and shuffle algebra
16. Compositional minimization of finite state systems
17. Verification and optimization of control programs by Petri nets without state explosion
18. An analysis of bitstate hashing
19. Numerical analysis of superposed GSPNs
20. Reachability analysis based on structured representations
21. Model checking based on Kronecker algebra
22. On the stochastic structure of parallelism and synchronisation models for distributed algorithms
23. Using magnetic disk instead of main memory in the Murφ verifier
24. Branching programs and binary decision diagrams