Synthesis of distributed algorithms using asynchronous automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2761, Issue , 2003, Pages 27-41

  Ştefǎnescu, Alin ^a   Esparza, Javier ^a   Muscholl, Anca ^b  

^a UNIVERSITY OF STUTTGART   (Germany)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ASYNCHRONOUS AUTOMATA; DISTRIBUTED SYSTEMS; IMPLEMENTATION MODELS; MUTUAL EXCLUSIONS; SYNTHESIS ALGORITHMS; SYNTHESIS PROBLEMS;

AUTOMATA THEORY;

EID: 35248842355     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (15)

1. AMoRE. http://www-i7.informatik.rwth-aachen.de/d/research/amore.html
2. E. Badouel and Ph. Darondeau. Theory of regions. In Lectures on Petri Nets I (Basic Models), LNCS 1491 (1998) 529-588.
3. I. Castellani, M. Mukund, and P.S. Thiagarajan. Synthesizing distributed transition systems from global specifications. In Proc. FSTTCS 19, LNCS 1739 (1999) 219-231.
4. V. Diekert and G. Rozenberg (Eds.) The Book of Traces. World Scientific, 1995.
5. E.A. Emerson and E.M. Clarke. Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming 2 (1982) 241-266.
6. O. Kupferman and M.Y. Vardi. Synthesizing distributed systems. In Proc. 16th IEEE Symp. on Logic in Computer Science, (2001).
7. A. Mazurkiewicz. Trace theory. In LNCS 255 (1987) 279-324.
8. R. Morin. Decompositions of asynchronous systems. In CONCUR'98, LNCS 1466 (1998) 549-564.
9. P. Madhusudan and P.S. Thiagarajan. A decidable class of asynchronous distributed controllers. In Proc. CONCUR'02, LNCS 2421 (2002) 145-160.
10. M. Mukund. From global specifications to distributed implementations. In Synthesis and Control of Discrete Event Systems, B. Caillaud, P. Darondeau, L. Lavagno (Eds.), Kluwer (2002) 19-34.
11. Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic. ACM TOPLAS 6(1) (1984) 68-93.
12. A. Pnueli and R. Rosner. On the synthesis of an asynchronous reactive module. In Proc. 16th ICALP, LNCS 372 (1989) 652-671.
13. A. Ştefǎnescu, J. Esparza, and A. Muscholl. Synthesis of distributed algorithms using asynchronous automata. Available at: http://www.fmi.uni-stuttgart.de/szs/publications/stefanan/concur03_full.ps
14. W. Zielonka. Notes on finite asynchronous automata. R.A.I.R.O. Inform. Théor. Appl. 21 (1987) 99-135.
15. W. Zielonka. Safe executions of recognizable trace languages by asynchronous automata. In LNCS 363 (1989) 278-289.