NDLI: Symbolic Supervisory Control of Timed Discrete Event Systems

Content Provider	IEEE Xplore Digital Library
Author	Miremadi, S. Zhennan Fei Akesson, K. Lennartson, B.
Copyright Year	1993
Abstract	We symbolically compute a nonblocking, controllable, and minimally restrictive supervisor for timed discrete event systems (TDESs), in the supervisory control theory context. We model TDES based on timed extended finite automata (TEFAs): an augmentation of extended finite automata (EFAs) by incorporating discrete time into the model. EFAs are ordinary automata extended with discrete variables, where conditional expressions and update functions can be attached to the transitions. The controllability is defined based on the corresponding tick models of the TEFAs. A tick can be considered as an event that is generated by a global digital clock. The tick models suffer from a major problem: the state size is very sensitive to the clock frequency. We show how a controllable supervisor, equivalent to the one computed based on the tick models, can be obtained by eliminating the tick events. To tackle large problems, all computations are conducted symbolically using binary decision diagrams (BDDs). We show that, based on the proposed approach, a fixed point is reached earlier in the reachability analysis and that the size of the intermediate BDDs usually becomes smaller. The framework has been applied to a real industrial application and several benchmarks.
Sponsorship	IEEE Control Systems Society
Starting Page	584
Ending Page	597
Page Count	14
File Size	3149906
File Format	PDF
ISSN	10636536
Volume Number	23
Issue Number	2
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Clocks Data structures Boolean functions Synchronization Computational modeling Automata Supervisory control timed extended finite automata (TEFAs) Binary decision diagrams (BDDs) supervisory control theory (SCT) timed discrete event systems (TDESs)
Content Type	Text
Resource Type	Article
Subject	Control and Systems Engineering Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Symbolic Representation and Computation of Timed Discrete-Event Systems

Efficient Symbolic Supervisor Synthesis for Extended Finite Automata

A BDD-Based Approach for Modeling Plant and Supervisor by Extended Finite Automata

BDD-based supervisory control on extended finite automata

Symbolic Computation of Reduced Guards in Supervisory Control

Representation of supervisory controls using state tree structures, binary decision diagrams, automata, and supervisor reduction

Efficient Analysis of Large Discrete-Event Systems with Binary Decision Diagrams

Symbolic computation of nonblocking control function for timed discrete event systems

Superior synthesis using Boolean matrix computation

Symbolic Supervisory Control of Timed Discrete Event Systems

Similar Documents

Symbolic Representation and Computation of Timed Discrete-Event Systems

Efficient Symbolic Supervisor Synthesis for Extended Finite Automata

A BDD-Based Approach for Modeling Plant and Supervisor by Extended Finite Automata

BDD-based supervisory control on extended finite automata

Symbolic Computation of Reduced Guards in Supervisory Control

Representation of supervisory controls using state tree structures, binary decision diagrams, automata, and supervisor reduction

Efficient Analysis of Large Discrete-Event Systems with Binary Decision Diagrams

Symbolic computation of nonblocking control function for timed discrete event systems

Superior synthesis using Boolean matrix computation

Symbolic Supervisory Control of Timed Discrete Event Systems