Unfoldings for Message Passing Timed Automata

Abstract

In this thesis we develop a state space reduction technique for networks of timed automata based on unfoldings to alleviate the state space explosion problem due to concurrently enabled actions. For the purpose of verifying a system, standard model checking techniques construct its sequential state space that su ers an exponential growth when applied to… (More)

Topics

19 Figures and Tables

Cite this paper

@inproceedings{Fahland2006UnfoldingsFM, title={Unfoldings for Message Passing Timed Automata}, author={Dirk Fahland}, year={2006} }