Efficient analysis of large Discrete-Event Systems with binary decision diagrams

被引：0

作者：

Vahidi, Arash ^{[1
]}

Lennartson, Bengt ^{[1
]}

Fabian, Martin ^{[1
]}

机构：

[1] Chalmers Univ Technol, Dept Signals & Syst, SE-41296 Gothenburg, Sweden

来源：

2005 44th IEEE Conference on Decision and Control & European Control Conference, Vols 1-8 | 2005年

关键词：

Discrete-Event Systems; supervisory control; reachability search; symbolic computation;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Efficient analysis and controller synthesis in the context of Discrete-Event Systems (DES) is discussed in this paper. We consider efficient reachability search for solving common problems in the Supervisory Control Theory (SCT). The search is based on symbolic computations including crucial partitioning techniques. Finally, the efficiency of the presented algorithms is demonstrated on a set of hand-made and real-world industrial systems.

引用

页码：2751 / 2756

页数：6

共 20 条

[1]

AJOUL F, 2003, P GREAT LAK S VLSI

[2]

[Anonymous], 2002, SCIENCE

[3]

ARKERYD D, 2000, THESIS CHALMERS U TE

[4]

Aziz A, 1994, P 31 DES AUT C, P283, DOI 10.1145/196244.196379

[5]

BREZOCNIK Z, 1996, P COST 247 INT WORKS, P146

[6]

Bryant RandalE., 1992, ACM Computing Surveys (CSUR), V24, P293

[7]

BURCH JR, 1991, P 1991 INT C VLSI

[8] CONSTRUCTIVE VERSIONS OF TARSKI FIXED-POINT THEOREMS [J].

COUSOT, P ;

COUSOT, R .

PACIFIC JOURNAL OF MATHEMATICS, 1979, 82 (01) :43-57

[9]

GELDENHUYS J, 2001, LECT NOTES COMPUTER, V2154, P233

[10]

Geser A, 1994, MIP9403 U PASS

← 1 2 →