Efficient computation and representation of large reachability sets for composed automata

DOI10.1023/A:1015669415634zbMath1048.93065OpenAlexW1505796501MaRDI QIDQ1610340

Peter Buchholz, Peter Kemper

Publication date: 19 August 2002

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015669415634

zbMATH Keywords

reachability analysisautomata networksKronecker representationordered natural decision diagrams

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete event control/observation systems (93C65) Attainable sets, reachability (93B03) Large-scale systems (93A15)

Related Items

Formal techniques for performance analysis: blending SAN and PEPA, Model-checking large structured Markov chains., Computational Probability for Systems Biology, Symbolic state-space exploration and numerical analysis of state-sharing composed models, Bisimulation relations for weighted automata, Deadlock and WCET analysis of barrier-synchronized concurrent programs