Complexity results for checking distributed implementability

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

Volumn 2005, Issue , 2005, Pages 78-87

  Heljanko, Keijo ^a   Ştefǎnescu, Alin ^b  

^a AALTO UNIVERSITY   (Finland)

^b UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA PROCESSING; LARGE SCALE SYSTEMS; MULTIPROCESSING SYSTEMS; PROBLEM SOLVING;

ASYNCHRONOUS AUTOMATA; BISIMILARITY; ISOMORPHISM; TRANSITION SYSTEM (TS);

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33746265880     PISSN: 15504808     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSD.2005.7     Document Type: Conference Paper

References (19)

1. A. Arnold. Finite transition systems and semantics of communicating systems. Prentice Hall, 1994.
2. E. Badouel, L. Bernardinello, and P. Darondeau. Polynomial algorithms for the synthesis of bounded nets. In TAP-SOFT'95, volume 915 of LNCS, pages 364-378. Springer, 1995.
3. E. Badouel, L. Bernardinello, and P. Darondeau. The synthesis problem for elementary net systems is NP-complete. TCS, 186(1-2): 107-134, 1997.
4. I. Castellani, M. Mukund, and P. Thiagarajan. Synthesizing distributed transition systems from global specifications. In FSTTCS19, volume 1739 of LNCS, pages 219-231. Springer, 1999.
5. A. Ehrenfeucht and G. Rozenberg. Partial (set) 2-structures I and II. Acta. Informatica, 27(4):315-368, 1990.
6. M. Garey and D. Johnson. Computers and Intractability: A guide to the theory of NP-completeness. Freeman, 1979.
7. K. Heljanko and A. Ştefǎnescu. Complexity results for checking distributed implementability. Technical Report 05/2004, Universität Stuttgart, 2004. Available on-line at http://www.fmi.uni-stuttgart.de/szs/ people/stefanescu/tr-05-2004.pdf.
8. J. Hopcroft and J. Ullman. Introduction to automata theory, languages, and computation. Addison Wesley, 1979.
9. R. Morin. Decompositions of asynchronous systems. In CONCUR'98, volume 1466 of LNCS, pages 549-564. Springer, 1998.
10. R. Morin. Hierarchy of asynchronous automata. In WDS'99, volume 28 of Electronic Notes in Theoretical Computer Science, pages 59-75, 1999.
11. M. Mukund. From global specifications to distributed implementations. In B. Caillaud, P. Darondeau, and L. Lavagno, editors, Synthesis and control of discrete event systems, pages 19-34. Kluwer, 2002.
12. M. Nielsen, G. Rozenberg, and P. Thiagarajan. Elementary transition systems. TCS, 96:3-33, 1992.
13. D. Peled, T. Wilke, and P. Wolper. An algorithmic approach for checking closure properties of temporal logic specifications and ω-regular languages. TCS, 195(2): 183-203, 1998.
14. S. Shukla, H. Hunt III, D. Rosenkrantz, and R. Stearns. On the complexity of relational problems for finite state processes. In ICALP'96, volume 1099 of LNCS, pages 466-477. Springer, 1996.
15. P. Simons, I. Niemelä, and T. Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1-2): 181-234, 2002.
16. A. Ştefǎnescu, J. Esparza, and A. Muscholl. Synthesis of distributed algorithms using asynchronous automata. In R. Amadio and D. Lugiez, editors, CONCUR'03, volume 2761 of LNCS, pages 27-41. Springer, 2003.
17. W. Vogler. Concurrent implementation of asynchronous transition systems. In ICAPTN'99, volume 1639 of LNCS, pages 284-303. Springer, 1999.
18. W. Zielonka. Notes on finite asynchronous automata. R.A.I.R.O. Inform. Théor. Appl., 21:99-135, 1987.
19. W. Zielonka. Safe executions of recognizable trace languages by asynchronous automata. In Logical Foundations of Computer Science, volume 363 of LNCS, pages 278-289. Springer, 1989.