NDLI: Efficient Symbolic Supervisor Synthesis for Extended Finite Automata

Content Provider	IEEE Xplore Digital Library
Author	Zhennan Fei Miremadi, S. Akesson, K. Lennartson, B.
Copyright Year	1993
Abstract	The state-space explosion problem, resulting from the reachability computations in controller synthesis, is one of the main obstacles preventing supervisory control theory from having an industrial breakthrough. To alleviate this problem, a strategy is to symbolically perform the synthesis procedure using binary decision diagrams. Based on this principle, the work presented in this brief develops an efficient symbolic reachability approach for discrete event systems that are modeled as finite automata with variables, referred to as extended finite automata. Using a disjunctive event partitioning technique, the proposed approach first partitions the transition relation of the considered system into a set of partial transition relations. These partial transition relations are then selected systematically to perform the reachability analysis, which is the most fundamental challenge for synthesizing supervisors. It has been shown through solving a set of benchmark supervisory control problems for EFA that the proposed approach significantly improves scalability in comparison with the previously published results.
Sponsorship	IEEE Control Systems Society
Starting Page	2368
Ending Page	2375
Page Count	8
File Size	738686
File Format	PDF
ISSN	10636536
Volume Number	22
Issue Number	6
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-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	Binary decision diagrams Data structures Automata Partitioning algorithms Reachability analysis Supervisory control supervisory control theory (SCT). Binary decision diagrams (BDDs) extended finite automata (EFA) partitioning techniques reachability analysis supervisory control theory (SCT)
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

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

Symbolic Supervisory Control of Timed Discrete Event Systems

BDD-based supervisory control on extended finite automata

Symbolic Representation and Computation of Timed Discrete-Event Systems

Symbolic Computation of Reduced Guards in Supervisory Control

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

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

Symbolic reachability computation using the disjunctive partitioning technique in Supervisory Control Theory

Efficient reachability analysis on modular discrete-event systems using binary decision diagrams

Efficient Symbolic Supervisor Synthesis for Extended Finite Automata

Similar Documents

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

Symbolic Supervisory Control of Timed Discrete Event Systems

BDD-based supervisory control on extended finite automata

Symbolic Representation and Computation of Timed Discrete-Event Systems

Symbolic Computation of Reduced Guards in Supervisory Control

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

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

Symbolic reachability computation using the disjunctive partitioning technique in Supervisory Control Theory

Efficient reachability analysis on modular discrete-event systems using binary decision diagrams

Efficient Symbolic Supervisor Synthesis for Extended Finite Automata