Efficient Computation and Representation of Large Reachability Sets for Composed Automata

13 years 4 months ago

Download ls4-www.informatik.uni-dortmund.de

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

Real-time Traffic

DEDS 2002 | Reachability Analysis | State Spaces | Transition Graph |

claim paper

» Functional Dependency for Verification Reduction

» Perfect Simulation of Stochastic Automata Networks

» Symbolic Systems Explicit Properties On Hybrid Approaches for LTL Symbolic Model Checking

» Efficient Symbolic Model Checking for Process Algebras

» CostOptimal Factored Planning Promises and Pitfalls

» Algorithms to accelerate multiple regular expressions matching for deep packet inspection

» Variancecomponent based sparse signal reconstruction and model selection

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	DEDS
Authors	Peter Buchholz, Peter Kemper

Comments (0)

Sciweavers

Efficient Computation and Representation of Large Reachability Sets for Composed Automata

DEDS 2002 | Reachability Analysis | State Spaces | Transition Graph |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers