Open maps, alternating simulations and control synthesis

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

Volumn 3170, Issue , 2004, Pages 466-480

  Tabuada, Paulo ^a  

^a University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE; SPECIFICATIONS;

ALTERNATING SIMULATION; BISIMULATIONS; CONTROL SYNTHESIS; DESIGN PARADIGM; DISTRIBUTED NETWORKS; REACTIVE PROGRAMS; TIMED TRANSITION SYSTEMS; TRANSITION SYSTEM;

CONCURRENCY CONTROL;

EID: 35048834713     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28644-8_30     Document Type: Article

References (25)

1. Ramadge, P., Wonham, W.M.: The control of discrete event systems. Proceedings of IEEE 77 (1989) 81-98
2. de Alfaro, L., Henzinger, T.A.: Interface theories for component-based design. In: Proceedings of the First International Workshop on Embedded Software. volume 2211 of Lecture Notes in Computer Science. (2001) 148-165
3. Benveniste, A., Haar, S., Fabre, E., Jard, C.: Distributed monitoring of concurrent and asynchronous systems. In Amadio, R.M., Lugiez, D., eds.: Proceedings of the 14th International Conference on Concurrency Theory (CONCUR). volume 2761 of Lecture Notes in Computer Science., Springer-Verlag (2003) 1-26
4. Tabuada, P., Pappas, G.J.: Linear time logic control of linear systems. (2004) Submitted for publication, available at www.nd.edu/~ptabuada.
5. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proceedings of the 16th ACM Symposium on Principles of Programming Languages. (1989) 170-190
6. Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In Press, I., ed.: Proceedings of the 31st Annual Symposium on Foundations of Computer Sience, St. Louis, Missouri (1990) 746-7577. Emerson, E.A., Clarke, E.M.: Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming 2 (1982) 241-266
7. Manna, Z., Wolper, P.: Synthesis of communication processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems 6 (1984) 68-93
8. Joyal, A., Nielsen, M., Winskel, G.: Bisimulation from open maps. Information and Computation 127 (1996) 164-185
9. Winskel, G., Nielsen, M.: Models for concurrency. In Abramsky, Gabbay, Maibaum, eds.: Handbook of Logic and Foundations of Theoretical Computer Science. volume 4. Oxford University Press, London (1994)
10. Nielsen, M., Cheng, A.: Observing behaviour categorically. In Thiagarajan, P.S., ed.: Foundations of Software Technology and Theoretical Computer Science. volume 1026 of Lecture Notes in Computer Science., Springer (1995) 263-278
11. Haghverdi, E., Tabuada, P., Pappas, G.: Bisimulation relations for dynamical and control systems. In Blute, R., Selinger, P., eds.: Electronic Notes in Theoretical Computer Science. volume 69., Elsevier (2003)
12. Alur, R., Henzinger, T., Kupferman, O., Vardi, M.: Alternating refinement relations. In: CONCUR 97: Concurrency Theory, 8th International Conference. Number 1466 in Lecture Notes in Computer Science (1998) 163-178
13. Madhusudan, P., Thiagarajan, P.: Branching time controllers for discrete event systems. Theoretical Computer Science 274 (2002) 117-149
14. Barret, G., Lafortune, S.: Bisimulation, the supervisor control problem and strong model matching for finite state machines. Journal of Discrete Event Systems 8 (1998) 337-429
15. Rutten, J.: Coalgebra, concurrency, and control. In Kluwer, ed.: Proceedings of the 5th Workshop on Discrete Event Systems (WODES 2000). (2000) 31-38.
16. Overkamp, A.: Supervisory control using failure semantics and partial specifications. IEEE Transactions on Automatic Control 42 (1997) 498-510
17. Kupferman, O., Madhusudan, P., Thiagarajan, P.S., Vardi, M.Y.: Open systems in reactive environments: Control and synthesis. In: Proceedings of the 11th International Conference on Concurency Theory. volume 1877 of Lecture Notes in Computer Science., Springer-Verlag (2000) 92-107
18. Antoniotti, M., Mishra, B.: NP-completeness of the supervisor synthesis problem for unrestricted CTL specifications. In Smedinga, R., Spathopoulos, M., Kozk, P., eds.: Proceedings on the International Workshop on Discrete Event Systems, WODES96, Edinburgh, Scotland, UK (1996)
19. Shengbing, J., Kumar, R.: Supervisory control of discrete event systems with CTL*temporal logic specifications. In: Proceedings of the 40th IEEE Conference on Decision and Control. volume 5. (2001) 4122-4127
20. Park, D.: Concurrency and automata on infinite sequences. volume 104 of Lecture Notes in Computer Science. (1981) 167-183
21. Milner, R.: Communication and Concurrency. Prentice Hall (1989)
22. Borceux, F.: Handbook of Categorical Algebra. Cambridge University Press (1994)
23. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126 (1994) 183-235
24. Nielsen, M., Hune, T.S.: Bisimulation and open maps for timed transition systems. Fundamenta Informaticae 38 (1999) 61-77
25. Moody, J.O., Antsaklis, P.J.: Supervisory Control of Discrete Event Systems Using Petri Nets. Kluwer Academic Publishers (1998)