Sciweavers

346 search results - page 9 / 70
» Determinizing Asynchronous Automata
Sort
View
FOSSACS
2000
Springer
14 years 2 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
ENTCS
2008
125views more  ENTCS 2008»
13 years 11 months ago
Extending Lustre with Timeout Automata
This paper describes an extension to Lustre to support the analysis of globally asynchronous, locally synchronous (GALS) architectures. This extension consists of constructs for d...
Jimin Gao, Mike Whalen, Eric Van Wyk