Nonconflict check by using sequential automaton abstractions

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

    Onderzoeksoutput: Boek/rapportRapportAcademic

    82 Downloads (Pure)

    Samenvatting

    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 over relatively small automata, even though the original system can be fairly large.
    Originele taal-2Engels
    Plaats van productieEindhoven
    UitgeverijTechnische Universiteit Eindhoven
    Aantal pagina's22
    StatusGepubliceerd - 2008

    Publicatie series

    NaamSE report
    Volume2008-10
    ISSN van geprinte versie1872-1567

    Vingerafdruk

    Duik in de onderzoeksthema's van 'Nonconflict check by using sequential automaton abstractions'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit