Modeling Decentralized Real-Time Control by State Space Partition of Timed Automata

Authors:
Thanikesavan Sivanthi;Srivas Chennu;Lothar Kreft
Affiliations:
Department of Communication Networks Hamburg University of Technology Schwarzenberg Strasse, BA 4d, D - 21073, Germany;Department of Communication Networks Hamburg University of Technology Schwarzenberg Strasse, BA 4d, D - 21073, Germany;Department of Communication Networks Hamburg University of Technology Schwarzenberg Strasse, BA 4d, D - 21073, Germany
Venue:
DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
Year:
2005

Citing 6
Cited 0

A software design method for distributed real-time applications

Journal of Systems and Software
A theory of timed automata

Theoretical Computer Science
UPPAAL—a tool suite for automatic verification of real-time systems

Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems

IEEE Transactions on Software Engineering
FSM Decomposition for Low Power in FPGA

FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
Decomposition of Finite State Machines for Area, Delay Minimization

ICCD '99 Proceedings of the 1999 IEEE International Conference on Computer Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.