Model abstraction for discrete-event systems by binary linear programming with applications to manufacturing systems

Model abstraction for finite state automata is helpful for decreasing computational complexity and improving comprehensibility for the verification and control synthesis of discrete-event systems (DES). Supremal quasi-congruence equivalence is an effective method for reducing the state space of DES...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Science progress (1916) Jg. 104; H. 3; S. 1 - 32
Hauptverfasser:	Cheng, Lihong, Feng, Lei, Li, Zhiwu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London, England Sage Publications, Ltd 01.07.2021 SAGE Publications Sage Publications Ltd
Schlagworte:	Algorithms Automata theory Automated guided vehicles Computational efficiency Computer applications Computer Science Control theory Datalogi deterministic finite automata Discrete event systems Equivalence Graph theory Industrial Information and Control Systems Industriella informations- och styrsystem Integer programming Linear programming Manufacturing Mixed integer model abstraction natural projection Optimization Partitioning quasi-congruence relation Solvers Supervisory control System effectiveness Translation quasi-congruence relation deterministic finite automata model abstraction Discrete-event systems natural projection
ISSN:	0036-8504, 2047-7163, 2047-7163
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!