Compositional Synthesis of Discrete Event Systems Using Synthesis Abstraction

• This paper proposes a general method to synthesizea least restrictive supervisor for a large discrete eventsystem model, consisting of a large number of arbitraryautomata representing the plants and specifications. A newtype of abstraction called synthesis abstraction is introducedand three rules are proposed to calculate an abstraction of agiven automaton. Furthermore, a compositional algorithm forsynthesizing a supervisor for large-scale systems of composedfinite-state automata is proposed. In the proposed algorithm, thesynchronous composition is computed step by step and intermediateresults are simplified according to synthesis abstraction.Then a supervisor for the abstracted system is calculated,which in combination with the original system gives the leastrestrictive, nonblocking, and controllable behaviour.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Nyckelord

state space explosion.

automata

Supervisory control theory

Publikations- och innehållstyp

kon (ämneskategori)

ref (ämneskategori)