Synthesis and Control of Asynchronous and Distributed Systems

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

Volumn , Issue , 2007, Pages 13-22

  Darondeau, Philippe ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS SYSTEMS; CONTROL SYNTHESIS; DISTRIBUTED SYSTEMS; INTERNATIONAL CONFERENCES; SURVEY RESEARCH; SYNTHESIS (OF CHIRAL IONIC LIQUIDS); SYSTEM DESIGNS;

MODEL CHECKING; SYSTEMS ANALYSIS;

CONTROL SYSTEMS;

EID: 51149101219     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSD.2007.33     Document Type: Conference Paper

References (74)

1. W. Zielonka. Notes on Finite Asynchronous Automata. RAIRO Informatique Théorique et Applications 21 pages 99-135, 1987.
2. P. J. Ramadge and W. M. Wonham. Supervisory Control of a Class of Discrete Event Processes. SIAM J. of Control and Optimization 25(1) pages 206-230, 1987
3. A. Ehrenfeucht and G. Rozenberg. Partial (Set) 2-Structures; Part I: Basic Notions and the Representation Problem. Acta Informatica 27 pages 315-342, 1990.
4. A. Ehrenfeucht and G. Rozenberg. Partial (Set) 2-Structures; Part II: State Spaces of Concurrent Systems. Acta Informatica 27 pages 343-368, 1990.
5. P. Merlin and G. von Bochman. On the Construction of Submodule Specifications and Communication Protocols. ACM Trans. Programming Languages and Systems 5(1) pages 1-25, 1983.
6. J. Parrow. Submodule Construction as Equation Solving in CCS. Theoretical Computer Science 68(2) pages 175-202, 1989.
7. K.G. Larsen and L. Xinxin. Equation Solving Using Modal Transition Systems. In Proc. LICS pages 108-117, 1990.
8. A. Arnold, A. Vincent, I. Walukiewicz. Games for Synthesis of Controllers with Partial Observation. Theoretical Computer Science 303(1) pages 7-34, 2003.
9. K. El-Fakih, N. Yevtushenko, S. Buffalov, and G. von Bochmann. Progressive Solutions to a Parallel Automata Equation. Theoretical Computer Science 362(1-3) pages 17-32, 2006.
10. D. Potop-Butucaru and B. Caillaud. Correct-by-Construction Asynchronous Implementation of Modular Synchronous Specifications. In Proc. ACSD pages 48-57, 2005.
11. H. Marchand, P. Boumai, M. Le Borgne, P. Le Guemic. Synthesis of Discrete-Event Controllers based on the Signal Environment. Discrete Event Dynamic System: Theory and Applications 10(4) pages 325-346, 2000.
12. P. Madhusudan and P. S. Thiagarajan. Distributed Controller Synthesis for Local Specifications. In Proc. ICALP 2076 pages 396-407, 2001.
13. S. Mohalik and I. Walukiewicz. Distributed Games. In Proc. FSTTCS, LNCS 2914 pages 338-351, 2003.
14. S. Schewe, B. Finkbeiner. Semi-automatic Distributed Synthesis. Int. J. Foundations of Computer Science 18(1) pages 113-138, 2007.
15. A. Arnold and M. Nivat. Comportements de processus. In Proc. Colloque AFCET "Les Mathématiques de l'Informatique" pages 35-68, 1982.
16. C. Duboc. Mixed Product and Asynchronous Automata. Theoretical Computer Science 48(3) pages 183-199, 1986.
17. R. Morin. Decompositions of Asynchronous Systems. In Proc. CONCUR, LNCS 1466 pages 549-564, 1998.
18. I. Castellani, M. Mukund, P. S. Thiagarajan. Synthesizing Distributed Transition Systems from Global Specification. In Proc. FSTTCS, LNCS 1738 pages 219-231, 1999.
19. M. Mukund. From Global Specifications to Distributed Implementations. In B. Caillaud et al. editors, Synthesis and Control of Discrete Event Systems pages 19-34, Kluwer, 2002.
20. K. Heljanko, A. Stefanescu. Complexity Results for Checking Distributed Implementability. In Proc. ACSD pages 78-87, 2005.
21. M. Mukund. Petri Nets and Step Transition Systems. Int. J. Foundations of Computer Science 3(4) pages 443-478, 1992.
22. E. Badouel and P. Darondeau. Theory of Regions. In W. Reisig and G. Rozenberg, editors, Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, LNCS 1491 pages 529-586, 1998.
23. E. Badouel, L. Bernardinello and P. Darondeau. Polynomial Algorithms for the Synthesis of Bounded Nets. In Proc. CAAP, LNCS 915 pages 647-679, 1995.
24. E. Badouel, L. Bernardinello and P. Darondeau. The Synthesis Problem for Elementary Net Systems is NP-Complete. Theoretical Computer Science 186(1-2) pages 107-134, 1997.
25. J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, A. Yakovlev. Hardware and Petri Nets: Application to Asynchronous Circuit Design. In Proc. ICATPN, LNCS 1825 pages 1-15, 2000.
26. E. Badouel and P. Darondeau. The Synthesis of Petri Nets from Path-automatic Specifications. Information and Computation 193(2) pages 117-135, 2004.
27. A. Ghaffari, N. Rezg and X. Xie. Design of Live and Maximally Permissive Petri Net Controller Using the Theory of Regions. IEEE Trans. on Robotics and Automation 19 pages 137-142, 2003.
28. E. Badouel and P. Darondeau. On the Synthesis of General Petri Nets. Inria Research Report 3025, 1996.
29. P. Darondeau. Unbounded Petri Net Synthesis. In J. Desel, W. Reisig and G. Rozenberg, editors, Lectures on Concurrency and Petri Nets I, LNCS 3098 pages 413-438, 2003.
30. P. Darondeau. Distributed Implementations of Ramadge-Wonham Supervisory Control with Petri Nets. In Proc. 44th IEEE Conference on Decision and Control and European Control Conference, pages 2107-2112, 2005.
31. S. A. Reveliotis, J. Choi. Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions. In Proc. ICATPN, LNCS 4024 pages 322-341, 2006.
32. Y. Willner and H. Heymann. Supervisory Control of Concurrent Discrete Event-systems. Int. J. Control 54(5) pages 1143-1169, 1991.
33. P.J. Ramadge and W.M. Wonham. Supervisory Control of a Class of Discrete Event Processes. SIAM J. of Control and Optimization 25 pages 206-230, 1987.
34. P.J. Ramadge and W.M. Wonham. On the Supremal Controllable Language of a Given Language. SIAM Journal of Control and Optimization 25 pages 637-659, 1987.
35. F. Lin and W.M. Wonham. On observability of discrete-event systems. Information Sciences 44 pages 173-198, 1988.
36. P.J. Ramadge and W.M. Wonham. The Control of Discrete Event Systems. Proc. of the IEEE, Special issue on Dynamics of Discrete Event Systems 77 pages 81-98, 1989.
37. K. Rudie and W.M. Wonham. Think Globally, Act Locally: Decentralized Supervisory Control. IEEE Trans. on Automatic Control 37(11) pages 1692-1708, 1992.
38. H. Lamouchi and J. Thistle. Effective Control Synthesis for DES under Partial Observations. In Proc. 39th IEEE Conference on Decision and Control, pages 22-28, 2000.
39. A. Pnueli and R. Rosnen Distributed Reactive Systems are Hard to Synthesize. In Proc. IEEE Conference on Foundations of Computer Science (2) pages 746-757, 1990.
40. F. Lin and W.M. Wonham. Decentralized Control and Coordination of Discrete Event Systems. In Proc. 27th IEEE Conference on Decision and Control, pages 1125-1130, 1988.
41. S. Jiang and R. Kumar. Decentralized Control of Discrete Event Systems with Specializations to Local Control and Concurrent Systems. IEEE Trans. on Systems, Man and Cybernetics, Part B 30(5) pages 653-660, 2000.
42. SH Lee and K.C. Wong. Structural decentralized control of concurrent discrete-event systems. European J. of Control 8(5) 2002.
43. L. Feng and W.M. Wonham. Computationally Efficient Supervisor Design: Abstraction and Modularity. In Proc. 8th Workshop on Discrete Event Systems, pages 3-8, 2006.
44. TS Yoo and S. Lafortune. A General Architecture for Decentralized Supervisory Control of Discrete-event Systems. Discrete-Event Dynamic Systems: Theory and Applications 12(3) pages 335-377, 2002.
45. G. Feuillade. Logical specification of Petri nets. PhD thesis, Université de Rennes 1, 2005.
46. A. Arnold and D. Niwinski. Rudiments of μ-Calculus, Studies in Logic 146, North-Holland, 2001.
47. K. G. Larsen. Modal Specifications. In Proc. Automatic Verification Methods for Finite State Systems, LNCS 407 pages 232-246, 1989.
48. B. Bloom, S. Istrail and A. R. Meyer. Bisimulation Can't be Traced. J. ACM 42(1) pages 232-268, 1995.
49. S. Riedweg and S. Pinchinat. You Can Always Compute Maximally Permissive Controllers Under Partial Observation When They Exist. In Proc. ACC (4) pages 2287-2292, 2005.
50. M. Mukund and M. Sohoni. Gossiping, Asynchronous Automata and Zielonka's Theorem. Report TCS-94-2, Chennai Mathematical Institute, 1994.
51. R. Cori, Y. Métivier, W. Zielonka. Asynchronous Mappings and Asynchronous Cellular Automata. Inf. Comput. 106(2) pages 159-202, 1993.
52. A. Stefanescu, J. Esparza and A. Muscholl. Synthesis of Distributed Algorithms Using Asynchronous Automata. In Proc. CONCUR, LNCS 2761 pages 27-41, 2003.
53. W. Zielonka. Safe Executions of Recognizable Trace Languages by Asynchronous Automata. In Proc. Logic at Botik, LNCS 363 pages 278-289, 1989.
54. B. Genest and A. Muscholl. Constructing Exponential-Size Deterministic Zielonka Automata. In Proc. ICALP (2) LNCS 4052 pages 565-576, 2006.
55. J. Sakarovitch. The "Last" Decision Problem for Rational Trace Languages. In Proc. LATIN, LNCS 583 pages 460-473, 1992.
56. P. Gastin, B. Lerman and M. Zeitoun. Distributed Games and Distributed Control for Asynchronous Systems. In Proc. LATIN, LNCS 2976 pages 455-465, 2004.
57. P. Madhusudan, P.S. Thiagarajan, S. Yang. The MSO Theory of Connectedly Communicating Processes. In Proc. FSTTCS, LNCS 3821 pages 201-212, 2005.
58. P. Gastin, B. Lerman and M. Zeitoun. Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems. In Proc. FSTTCS, LNCS 3328 pages 275-286, 2004.
59. D. Brand and P. Zafiropulo. On Communicating Finite-state Machines. J. ACM 30(2) pages 323-342, 1983.
60. M. Mukund, K. Narajan Kumar and M. Sohoni. Synthesizing distributed Finite-State Systems from MSCs. In Proc. CONCUR, LNCS 1877 pages 521-535, 2000.
61. B. Genest. On Implementation of Global Concurrent Systems with Local Asynchronous Controllers. In Proc. CONCUR, LNCS 3653 pages 443-457, 2005.
62. B. Caillaud. Bounded Petri-net Synthesis Techniques and their Application to the Distribution of Reactive Automata. European J. Automation 33 (9,10) pages 925-942, 1999.
63. E. Badouel, B. Caillaud and P. Darondeau. Distributing Finite Automata Through Petri Net Synthesis. Formal Aspects of Computing 13(6) pages 447-470, 2002.
64. ITU-TS, Recommendation Z-120, Message Sequence Chart (MSC), ITU-TS, Geneva, Switzerland, 1996.
65. B. Genest, A. Muscholl, D. Kuske. A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. In Proc. DLT, LNCS 3340 pages 30-48, 2004.
66. J.G. Henriksen, M. Mukund, K. Narayan Kumar and P.S. Thiagarajan. Towards a Theory of Regular MSC Languages. BRICS Report RS-99-52, Aarhus, 1999.
67. R. Alur, K. Etessami and M. Yannakakis. Readability and Verification of MSC Graphs. In Proc. ICALP, LNCS 2076 pages 797-808, 2001.
68. B. Genest, D. Kuske, A. Muscholl. A Kleene Theorem and Model Checking Algorithms for Existentially Bounded Communicating Automata. Information and Computation 204(6) pages 920-956, 2006.
69. W. Zielonka. Asynchronous Automata. In The Book of Traces, V. Diekert and G. Rozenberg editors, World Scientific, pages 205-247, 1995.
70. D. Kuske. A Further Step towards a Theory of Regular MSC Languages. In Proc. STACS, LNCS 2285 pages 489-500, 2002.
71. N. Baudru and R. Morin. Safe Implementability of Regular Message Sequence Chart Specifications. In Proc. SNPD, W. Dosch and R. Y. Lee editors, ACIS, pages 210-217, 2003.
72. B. Caillaud, P. Darondeau, L. Helouët, G. Lesventes. HMSCs as Partial Specifications ... with PNs as Completions. Summer School MOVEP 2000, LNCS 2067 pages 125-152, 2001.
73. F. Basile, P. Chiacchio amd C. Seatzu. Optimal Petri Net Monitor Design. In B. Caillaud et al. editors, Synthesis and Control of Discrete Event Systems pages 141-152, Kluwer, 2002.
74. K. Rudie and S. Lafortune. Minimal Communication in a Distributed Discrete-Event System. IEEE Trans. on Automatic Control 48(6) pages 957-975. 2003.