SwePub
Sök i LIBRIS databas

  Extended search

id:"swepub:oai:research.chalmers.se:f7df9b6f-0806-4075-91e2-bfd22674c08e"
 

Search: id:"swepub:oai:research.chalmers.se:f7df9b6f-0806-4075-91e2-bfd22674c08e" > Compositional coord...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Compositional coordinator synthesis of extended finite automata

Goorden, Martijn (author)
Technische Universiteit Eindhoven,Eindhoven University of Technology
Fabian, Martin, 1960 (author)
Chalmers tekniska högskola,Chalmers University of Technology
van de Mortel-Fronczak, Joanna M. (author)
Technische Universiteit Eindhoven,Eindhoven University of Technology
show more...
Reniers, Michel A. (author)
Technische Universiteit Eindhoven,Eindhoven University of Technology
Fokkink, Wan J. (author)
Vrije Universiteit Amsterdam (VU)
Rooda, Jacobus E. (author)
Technische Universiteit Eindhoven,Eindhoven University of Technology
show less...
 (creator_code:org_t)
2021-01-07
2021
English.
In: Discrete Event Dynamic Systems: Theory and Applications. - : Springer Science and Business Media LLC. - 0924-6703 .- 1573-7594. ; 31:3, s. 317-348
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • To avoid the state-space explosion problem, a set of supervisors may be synthesized using divide and conquer strategies, like modular or multilevel synthesis. Unfortunately, these supervisors may be conflicting, meaning that even though they are individually non-blocking, they are together blocking. Abstraction-based compositional nonblocking verification of extended finite automata provides means to verify whether a set of models is nonblocking. In case of a blocking system, a coordinator can be synthesized to resolve the blocking. This paper presents a framework for compositional coordinator synthesis for discrete-event systems modeled as extended finite automata. The framework allows for synthesis of a coordinator on the abstracted system in case compositional verification identifies the system to be blocking. As the abstracted system may use notions not present in the original model, like renamed events, the synthesized coordinator is refined such that it will be nonblocking, controllable, and maximally permissive for the original system. For each abstraction, it is shown how this refinement can be performed. It turns out that for the presented set of abstractions the coordinator refinement is straightforward.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Inbäddad systemteknik (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Embedded Systems (hsv//eng)
TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Reglerteknik (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Control Engineering (hsv//eng)
TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Datorsystem (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Computer Systems (hsv//eng)

Keyword

Compositional synthesis
Nonblocking
Extended finite automata
Supervisory control theory

Publication and Content Type

art (subject category)
ref (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view