On implementation of global concurrent systems with local asynchronous controllers

Lecture Notes in Computer Science

Volumn 3653, Issue , 2005, Pages 443-457

  Genest, Biaise ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; CONTROL EQUIPMENT; THEOREM PROVING;

ASYNCHRONOUS CONTROLLERS; CONCURRENT MODELS; CONCURRENT SYSTEMS;

CONCURRENT ENGINEERING;

EID: 27244441820     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539452_34     Document Type: Conference Paper

References (23)

1. R. Alur, K. Etessami, and M. Yannakakis. Realizability and verification of MSC graphs. In ICALP'01, LNCS 2076, pp.797-808, 2001.
2. B. Bollig and M. Leucker. Message-Passing Automata are expressively equivalent to EMSO Logic. In CONCUR'04, LNCS 3170, pp. 146-160, 2004.
3. N. Baudru and R. Morin. Safe implementability of regular message sequence chart specifications. In SNPD'03, pp 210-217. ACIS, 2003.
4. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):pp.323-342, 1983.
5. B. Caillaud, P. Darondeau, L. Hélouët, and G. Lesventes. HMSCs as partial specifications... with PNs as completions. In Modeling and Verification of Parallel Processes, 4th Summer School, MOVEP 2000, Nantes, Prance 2000.
6. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
7. P. Gastin, B. Lerman, M. Zeitoun. Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems. In FSTTCS'04, LNCS 3328, pp. 275-286, 2004.
8. B. Genest. Compositional Message Sequence Charts (CMSCs) are better to Implement than MSCs. In TACAS'05, LNCS, pp. 429-444, 2005.
9. B. Genest, D. Kuske and A. Muscholl. A Kleene Theorem and Model Checking for a Class of Communicating Automata. In DLT'04, LNCS 3340, pp. 30-48, 2004.
10. E. Gunter, A. Muscholl, and D. Peled. Compositional Message Sequence Charts. In TACAS'01, LNCS 2031, pp. 496-511, 2001.
11. Journal version International Journal on Software Tools for Technology Transfer (STTT) 5(1): 78-89 (2003).
12. J. G. Henriksen, M. Mukund, K. Narayan Kumar, M. Sohoni and P. Thiagarajan. A Theory of Regular MSC Languages. To appear in Information and Computation, available at http://www.comp.nus.edu.sg/~thiagu/public.papers/ icregmsc.pdf.
13. D. Kuske. Regular sets of infinite message sequence charts. In Information and Computation 187, Academic Press, pp.80-109, 2003.
14. M. Lohrey and A. Muscholl. Bounded MSC communication. Information and Computation, (189):135-263, 2004.
15. P. Madhusudan and B. Meenakshi, Beyond Message Sequence Graphs. In FSTTCS'01, LNCS 2245, pp. 256-267, 2001.
16. P. Madhusudan and P.S. Thiagarajan. Distributed Controller Synthesis for Local Specifications. In ICALP'01, LNCS 2076, pp. 396-407,2001.
17. P. Madhusudan and P.S. Thiagarajan. A Decidable Class of Asynchronous Distributed Controllers. In CONCUR'02, LNCS 2421, pp. 145-160, 2002.
18. S. Mohalik and I. Walukiewicz. Distributed Games. In FSTTCS'03, LNCS 2914, pp. 338-351, 2003.
19. M. Mukund, K. Narayan Kumar and M. Sohoni. Synthesizing Distributed Finite-State Systems from MSCs. In CONCUR 2000, LNCS 1877, pp. 521-535, 2000.
20. A. Pnueli and R. Rosner. Distributed Reactive Systems Are Hard to Synthesize. In FOCS 1990, pp. 746-757, 1990.
21. J.H. Reif. The Complexity of Two-player Games of Incomplete Information. J. Comp. Sys. Sci. 29, pp 274-301, 1984.
22. USB 1.1 specification, available at http://www.usb.org/developers/docs/ usbspec.zip
23. W. Zielonka. Note on finite asynchronous automata, R.A.I.R.O. Informatique Théorique et Applications, 21:pp.99-135, 1987.