CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

FIVE ABSTRACTION RULES TO REMOVE TRANSITIONS WHILE PRESERVING COMPOSITIONAL SYNTHESIS RESULTS

FIVE ABSTRACTION RULES TO REMOVE TRANSITIONS WHILE PRESERVING COMPOSITIONAL SYNTHESIS RESULTS

Sahar Mohajerani (Institutionen för signaler och system, Automation) ; Robi Malik ; Martin Fabian (Institutionen för signaler och system, Automation)
2014. - 34 s.
[Rapport]

This working paper investigates under which conditions transitions can be removed from an automaton while preserving important synthesis properties. The work is part of a framework for compositional synthesis of least restrictive controllable and nonblocking supervisors for modular discrete event systems. The method for transition removal complements previous results, which are largely focused on state merging. Issues concerning transition removal in synthesis are discussed, and redirection maps are introduced to enable a supervisor to process an event, even though the corresponding transition is no longer present in the model. Based on the results, different techniques are proposed to remove controllable and uncontrollable transitions, and an example shows the potential of the method for practical problems.

Nyckelord: Supervisory control theory, automata, synthesis, abstraction



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2014-01-20. Senast ändrad 2016-02-01.
CPL Pubid: 192915