Notes on finite asynchronous automata

Zielonka, Wiesław

doi:10.1051/ita/1987210200991

Cited by 211 publications

(114 citation statements)

References 10 publications

Supporting

Mentioning

114

Contrasting

Order By: Relevance

“…, then a Cvpa can be seen as a simple asynchronous automaton [8,27]. It is easy to show that the language…”

Section: Definition 5 a Concurrent Visibly Pushdown Automaton (Cvpa)mentioning

confidence: 99%

“…Even if we restrict to k-phase words, a deterministic variant of Mvpa is strictly weaker, unless we have Σ = Σ int [16,27].…”

Section: Concurrentmentioning

confidence: 99%

“…The first step is to provide an automata model that captures both asynchronous procedure calls and shared-variable communication. To this aim, we combine visibly pushdown automata [2] and asynchronous automata [27], which, seen individually, constitute robust automata classes with desirable closure properties and decidable verification problems.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Realizability of Concurrent Recursive Programs

Bollig

Grindei

Habermehl

2009

Foundations of Software Science and Computational Structures

View full text Add to dashboard Cite

Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicating via shared actions. Actually, we combine multi-stack visibly pushdown automata and Zielonka's asynchronous automata towards a model with an undecidable emptiness problem. However, a reasonable restriction allows us to lift Zielonka's Theorem to this recursive setting and permits a logical characterization in terms of a suitable monadic second-order logic. Building on results from Mazurkiewicz trace theory and work by La Torre, Madhusudan, and Parlato, we thus develop a framework for the specification, synthesis, and verification of concurrent recursive processes.

show abstract

“…, then a Cvpa can be seen as a simple asynchronous automaton [8,27]. It is easy to show that the language…”

Section: Definition 5 a Concurrent Visibly Pushdown Automaton (Cvpa)mentioning

confidence: 99%

“…Even if we restrict to k-phase words, a deterministic variant of Mvpa is strictly weaker, unless we have Σ = Σ int [16,27].…”

Section: Concurrentmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Realizability of Concurrent Recursive Programs

Bollig

Grindei

Habermehl

2009

Foundations of Software Science and Computational Structures

View full text Add to dashboard Cite

show abstract

“…As observed in [1,6,12,16] it is often convenient to describe the runs of such systems as a state-labeling of words decorated with a matching relation per data-structure instead of the traditional operational semantics using configurations and moves. This will prove all the more useful when we move to the distributed setting where traditionally semantics has always been given as state-labelings of appropriate partial orders [8,10,18].…”

Section: Systems With Stacks and Queuesmentioning

confidence: 99%

“…Related Work: In the study of distributed automata a number of difficult synthesis theorems [8][9][10]18] have been proved. These theorems in conjunction with constructions for intersections yield controllers for these classes.…”

Section: Introductionmentioning

confidence: 99%

Controllers for the Verification of Communicating Multi-pushdown Systems

Aiswarya

Gastin

Kumar

2014

CONCUR 2014 – Concurrency Theory

View full text Add to dashboard Cite

Abstract. Multi-pushdowns communicating via queues are formal models of multi-threaded programs communicating via channels. They are turing powerful and much of the work on their verification has focussed on under-approximation techniques. Any error detected in the underapproximation implies an error in the system. However the successful verification of the under-approximation is not as useful if the system exhibits unverified behaviours. Our aim is to design controllers that observe/restrict the system so that it stays within the verified underapproximation. We identify some important properties that a good controller should satisfy. We consider an extensive under-approximation class, construct a distributed controller with the desired properties and also establish the decidability of verification problems for this class.

show abstract