Efficient nonconflict check by using automaton abstractions

R. Su; J.H. Van Schuppen; J.E. Rooda; A.T. Hofkamp

Efficient nonconflict check by using automaton abstractions

R. Su, J.H. Van Schuppen, J.E. Rooda, A.T. Hofkamp

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

In Ramadge-Wonham supervisory control theory we often need to check nonconflict of plants and corresponding synthesized supervisors. For a large system such a check imposes a great computational challenge because of the complexity incurred by composition of plants and supervisors. In this paper we present a novel procedure based on automaton abstractions, which removes internal transitions of relevant automata at each step, allowing the nonconflict check to be performed on relatively small automata, even though the original system can be fairly large.

Original language	English
Title of host publication	Proceedings of 10th European Control Conference (ECC'09), 23-26 August 2009, Budapest, Hungary
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	1997-2002
Number of pages	6
ISBN (Print)	978-3-9524173-9-3
Publication status	Published - 2009
Event	10th European Control Conference, ECC 2009 - Budapest, Hungary Duration: 23 Aug 2009 → 26 Aug 2009 Conference number: 10 http://www.conferences.hu/ecc09/

Conference

Conference	10th European Control Conference, ECC 2009
Abbreviated title	ECC 2009
Country/Territory	Hungary
City	Budapest
Period	23/08/09 → 26/08/09
Internet address	http://www.conferences.hu/ecc09/

Keywords

Automaton abstraction
Discrete-event systems
Nonconflict
Nondeterministic finitestate automata

Cite this

@inproceedings{eb23f694a5cf4907879e21a687e5711f,

title = "Efficient nonconflict check by using automaton abstractions",

abstract = "In Ramadge-Wonham supervisory control theory we often need to check nonconflict of plants and corresponding synthesized supervisors. For a large system such a check imposes a great computational challenge because of the complexity incurred by composition of plants and supervisors. In this paper we present a novel procedure based on automaton abstractions, which removes internal transitions of relevant automata at each step, allowing the nonconflict check to be performed on relatively small automata, even though the original system can be fairly large.",

keywords = "Automaton abstraction, Discrete-event systems, Nonconflict, Nondeterministic finitestate automata",

author = "R. Su and {Van Schuppen}, J.H. and J.E. Rooda and A.T. Hofkamp",

year = "2009",

language = "English",

isbn = "978-3-9524173-9-3",

pages = "1997--2002",

booktitle = "Proceedings of 10th European Control Conference (ECC'09), 23-26 August 2009, Budapest, Hungary",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "10th European Control Conference, ECC 2009, ECC 2009 ; Conference date: 23-08-2009 Through 26-08-2009",

url = "http://www.conferences.hu/ecc09/",

}

Su, R, Van Schuppen, JH, Rooda, JE & Hofkamp, AT 2009, Efficient nonconflict check by using automaton abstractions. in Proceedings of 10th European Control Conference (ECC'09), 23-26 August 2009, Budapest, Hungary., TuA8.6, Institute of Electrical and Electronics Engineers, Piscataway, pp. 1997-2002, 10th European Control Conference, ECC 2009, Budapest, Hungary, 23/08/09.

Efficient nonconflict check by using automaton abstractions. / Su, R.; Van Schuppen, J.H.; Rooda, J.E. et al.

Proceedings of 10th European Control Conference (ECC'09), 23-26 August 2009, Budapest, Hungary. Piscataway : Institute of Electrical and Electronics Engineers, 2009. p. 1997-2002 TuA8.6.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Efficient nonconflict check by using automaton abstractions

AU - Su, R.

AU - Van Schuppen, J.H.

AU - Rooda, J.E.

AU - Hofkamp, A.T.

N1 - Conference code: 10

PY - 2009

Y1 - 2009

N2 - In Ramadge-Wonham supervisory control theory we often need to check nonconflict of plants and corresponding synthesized supervisors. For a large system such a check imposes a great computational challenge because of the complexity incurred by composition of plants and supervisors. In this paper we present a novel procedure based on automaton abstractions, which removes internal transitions of relevant automata at each step, allowing the nonconflict check to be performed on relatively small automata, even though the original system can be fairly large.

AB - In Ramadge-Wonham supervisory control theory we often need to check nonconflict of plants and corresponding synthesized supervisors. For a large system such a check imposes a great computational challenge because of the complexity incurred by composition of plants and supervisors. In this paper we present a novel procedure based on automaton abstractions, which removes internal transitions of relevant automata at each step, allowing the nonconflict check to be performed on relatively small automata, even though the original system can be fairly large.

KW - Automaton abstraction

KW - Discrete-event systems

KW - Nonconflict

KW - Nondeterministic finitestate automata

UR - http://www.scopus.com/inward/record.url?scp=84955214837&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84955214837

SN - 978-3-9524173-9-3

SP - 1997

EP - 2002

BT - Proceedings of 10th European Control Conference (ECC'09), 23-26 August 2009, Budapest, Hungary

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

T2 - 10th European Control Conference, ECC 2009

Y2 - 23 August 2009 through 26 August 2009

ER -

Efficient nonconflict check by using automaton abstractions

Abstract

Conference

Keywords

Other files and links

Fingerprint

Cite this