Automata and concurrency

Concurrency in Timed Automata

Asynchronous Cellular Automata and Logic for Pomsets without Auto-concurrency

This paper extends to pomsets without auto-concurrency the fundamental notion of asynchronous cellular automata (ACA) which was originally introduced for traces by Zielonka. We generalize to pomsets the notion of asynchronous mapping introduced by Zielonka and we show how to construct a deterministic ACA from an asynchronous mapping. Our main result generalizes Buchi's theorem for nite words t...

Applications of Automata and Concurrency Theory in Networks

Networks have received widespread attention in recent years as a target for domain-specific language design. The emergence of software-defined networking (SDN) as a popular paradigm for network programming has led to the appearance of a number of SDN programming languages seeking to provide high-level abstractions to simplify the task of specifying the packet-processing behavior of a network. P...

Concurrency theory - calculi and automata for modelling untimed and timed concurrent systems

CONCURRENCY THEORY CALCULI AN AUTOMATA FOR MODELLING UNTIMED AND TIMED CONCURRENT SYSTEMS Are you looking for ebook concurrency theory calculi an automata for modelling untimed and timed concurrent systems PDF? You will be glad to know that right now concurrency theory calculi an automata for modelling untimed and timed concurrent systems PDF is available on our online library. With our online ...

HYPERGROUPS AND GENERAL FUZZY AUTOMATA

In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...