Ninth IEEE International Symposium on Distributed Simulation and Real-Time Applications Modeling Decentralized Real-Time Control by State Space Partition of Timed Automata Montreal, Canada October 10-October 11 ISBN: 0-7695-2462-1
Timed automata provide useful state machine based representations for the validation and verification of realtime control systems. This paper introduces an algorithmic methodology to translate the state space visualization of a centralized real-time control system to a decentralized one. Given a set of timed automata representing a centralized real-time control system, the algorithm partitions them into a collection of interacting submachines. Importantly, this methodology allows for model-checking of the derived decentralized system against the same set of verifications as that speci?ed for the centralized system. The complexity analysis of the algorithm is presented as a function of the number of tasks and nodes comprising the decentralized system.
Citation:
Thanikesavan Sivanthi, Srivas Chennu, Lothar Kreft, "Modeling Decentralized Real-Time Control by State Space Partition of Timed Automata," ds-rt, pp.229-235, Ninth IEEE International Symposium on Distributed Simulation and Real-Time Applications, 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||