loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Z. Fei ; S. Miremadi ; K. Åkesson and B. Lennartson

Affiliation: Chalmers University of Technology, Sweden

Keyword(s): Supervisory control theory, Deterministic finite automata, Symbolic representation, Reachability search, Propositional formula.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Formal Methods ; Industrial Applications of AI ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Planning and Scheduling ; Simulation and Modeling ; Soft Computing ; State Space Search ; Symbolic Systems

Abstract: The supervisory control theory (SCT) is a model-based framework which automatically synthesizes a supervisor that restricts a plant to be controlled based on specifications to be fulfilled. Two main problems typically encountered in industrial applications prevent SCT from having a major breakthrough. First, the supervisor which is synthesized automatically from the given plant and specification models might be incomprehensible to the users. To tackle this problem, in our previous work, an approach was presented to extract compact propositional formulae from the supervisor represented symbolically by binary decision diagrams (BDD) and attach them to the original models. However, this approach, which computes the supervisor symbolically in the conjunctive way, might lead to another problem: the state-space explosion, because of the large number of intermediate BDD nodes during computation. In this paper, we introduce an alternative approach to alleviate this problem, which is based on the disjunctive partitioning technique including a set of selection heuristics. Then this approach is adapted to the guard generation procedure. Finally, the efficiency of the presented approach is demonstrated on a set of benchmark examples. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.81.97.37

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Fei, Z.; Miremadi, S.; Åkesson, K. and Lennartson, B. (2011). EFFICIENT SYMBOLIC SUPERVISORY SYNTHESIS AND GUARD GENERATION - Evaluating Partitioning Techniques for the State-space Exploration. In Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART; ISBN 978-989-8425-40-9; ISSN 2184-433X, SciTePress, pages 106-115. DOI: 10.5220/0003178801060115

@conference{icaart11,
author={Z. Fei. and S. Miremadi. and K. Åkesson. and B. Lennartson.},
title={EFFICIENT SYMBOLIC SUPERVISORY SYNTHESIS AND GUARD GENERATION - Evaluating Partitioning Techniques for the State-space Exploration},
booktitle={Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART},
year={2011},
pages={106-115},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003178801060115},
isbn={978-989-8425-40-9},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART
TI - EFFICIENT SYMBOLIC SUPERVISORY SYNTHESIS AND GUARD GENERATION - Evaluating Partitioning Techniques for the State-space Exploration
SN - 978-989-8425-40-9
IS - 2184-433X
AU - Fei, Z.
AU - Miremadi, S.
AU - Åkesson, K.
AU - Lennartson, B.
PY - 2011
SP - 106
EP - 115
DO - 10.5220/0003178801060115
PB - SciTePress