Recognizable trace languages, distributed automata and the distribution problem (Q1323363)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Recognizable trace languages, distributed automata and the distribution problem
scientific article

    Statements

    Recognizable trace languages, distributed automata and the distribution problem (English)
    0 references
    0 references
    10 May 1994
    0 references
    We introduce new finite state ``parallel machines'', the \((\mathbb{N}\)- )distributed automata, for trace languages. We prove that these machines give a new characterization of recognizable trace languages: a trace language is recognizable if and only if it is recognized by a \((\mathbb{N}\)- )distributed automaton. At last, we show how the classical problem of distribution of uninterpreted tasks on several processors can be straightforward modelized by recognizable trace languages and solved using \((\mathbb{N}\)-)distributed automata.
    0 references
    concurrent processes
    0 references
    distributed automata
    0 references
    recognizable trace languages
    0 references

    Identifiers