Sciweavers

60 search results - page 1 / 12
» A Synthesis Framework Based on Trace and Automata Theory
Sort
View
ISCAS
1994
IEEE
61views Hardware» more  ISCAS 1994»
13 years 9 months ago
A Synthesis Framework Based on Trace and Automata Theory
Jérôme Fron, Jerry Chih-Yuan Yang, Ma...
FOSSACS
2009
Springer
14 years 1 days ago
Realizability of Concurrent Recursive Programs
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 communicati...
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habe...
CONCUR
2003
Springer
13 years 10 months ago
Synthesis of Distributed Algorithms Using Asynchronous Automata
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
Alin Stefanescu, Javier Esparza, Anca Muscholl
ATVA
2006
Springer
130views Hardware» more  ATVA 2006»
13 years 9 months ago
The Implementation of Mazurkiewicz Traces in POEM
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
Peter Niebert, Hongyang Qu
FOSSACS
2000
Springer
13 years 8 months ago
On Recognizable Stable Trace Languages
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
Jean-François Husson, Rémi Morin