Efficient Computation and Representation of Large Reachability Sets for Composed Automata

We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized components. State spaces and transition graphs are

• Type: Journal
• Year: 2002
• Where: DEDS
• Authors: Peter Buchholz, Peter Kemper
• Keywords: DEDS 2002, Reachability Analysis, State Spaces, Transition Graph