Grid automata and supervisory control of dense real-time discrete event systems

Authors:
Mustapha Nourelfath;Ahmed Khoumsi
Affiliations:
Department of Mechanical Engineering, Network Organization Technology Research Center (CENTOR), Université Laval, Que., Canada;Department of Electrical and Computer Engineering, University of Sherbrooke, Que., Canada
Venue:
Mathematics and Computers in Simulation
Year:
2006

Citing 11
Cited 1

A blackboard architecture for control

Artificial Intelligence
Supervisory control of a class of discrete event processes

SIAM Journal on Control and Optimization
On the supermal controllable sublanguage of a given language

SIAM Journal on Control and Optimization
Techniques for automatic verification of real-time systems

Techniques for automatic verification of real-time systems
A theory of timed automata

Theoretical Computer Science
Testing timed automata

Theoretical Computer Science
Timed Wp-Method: Testing Real-Time Systems

IEEE Transactions on Software Engineering
Automata For Modeling Real-Time Systems

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Timing Assumptions and Verification of Finite-State Concurrent Systems

Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Minimizable Timed Automata

FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Time Abstracted Bisimiulation: Implicit Specifications and Decidability

Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics

SetExp: a method of transformation of timed automata into finite state automata

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a generalization of the classical supervisory control theory for discrete event systems to a setting of dense real-time systems modeled by Alur and Dill timed automata. The main problem involved is that in general the state space of a timed automaton is (uncountably) infinite. The solution is to reduce the dense time transition system to an appropriate finite discrete subautomaton, the grid automaton, which contains enough information to deal with the timed supervisory control problem (TSCP). The plant and the specifications region graphs are sampled for a granularity defined in a way that each state has an outgoing transition labeled with the same time amount. We redefine the controllability concept in the context of grid automata, and we provide necessary and sufficient solvability conditions under which the optimal solution to centralized supervisory control problems in timed discrete event systems under full observation can be obtained. The enhanced setting admits subsystem composition and the concept of forcible event. A simple example illustrates how the new method can be used to solve the TSCP.