Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

MFCS
2005
Springer

favoriteEmaildiscussreport

121views Theoretical Computer Science» more MFCS 2005»

Concurrent Automata vs. Asynchronous Systems

14 years 4 months ago

Concurrent Automata vs. Asynchronous Systems

Download www.cmi.univ-mrs.fr

We compare the expressive power of two automata-based ﬁnite-state models of concurrency. We show that Droste’s and Kuske’s coherent stably concurrent automata and Bednarczyk’s forward-stable asynchronous systems describe the same class of regular event structures. This connection subsumes a previous study by Schmitt which relates Stark’s trace automata to asynchronous systems. This work relies on Zielonka’s theorem and some unrecognized result due to Arnold.

Rémi Morin

Real-time Traffic

Asynchronous Systems | Automata-based ﬁnite-state Models | Forward-stable Asynchronous Systems | MFCS 2005 |

claim paper

Related Content

» Realizability of Concurrent Recursive Programs

» On Recognizable Stable Trace Languages

» The reactive simulatability RSIM framework for asynchronous systems

» Selfreplication Evolvability and Asynchronicity in Stochastic Worlds

» Testing InputOutput Partial Order Automata

» Alternatingtime stream logic for multiagent systems

» Reachability Analysis of Multithreaded Software with Asynchronous Communication

» Answer Set Programming and Bounded Model Checking

» Specifying Interacting Components with Coordinated Concurrent Scenarios

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	MFCS
Authors	Rémi Morin

Comments (0)