Sciweavers

Share
DEDS
2002

Efficient Computation and Representation of Large Reachability Sets for Composed Automata

11 years 5 months ago
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
Peter Buchholz, Peter Kemper
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2002
Where DEDS
Authors Peter Buchholz, Peter Kemper
Comments (0)
books