Synthesis of safe message-passing systems

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

Volumn 4855 LNCS, Issue , 2007, Pages 277-289

  Baudru, Nicolas ^a   Morin, Rémi ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; SECURITY SYSTEMS;

DEADLOCK; LOCAL TERMINATION;

MESSAGE PASSING;

EID: 38349008481     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77050-3_23     Document Type: Conference Paper

References (13)

1. Alur, R., Etessami, K., Yannakakis, M.: Readability and verification of MSC graphs. TCS 331, 97-114 (2005)
2. Baudru, N., Morin, R.: Safe Implementability of Regular Message Sequence Charts Specifications. In: Proc. of the ACIS 4th Int. Conf. SNDP, pp. 210-217 (2003)
3. Bollig, B., Leucker, M.: Message-passing automata are expressively equivalent to EMSO logic. TCS 358, 150-172 (2006)
4. Bracho, F., Droste, M., Kuske, D.: Representations of computations in concurrent automata by dependence orders. TCS 174, 67-96 (1997)
5. Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific (1995)
6. Droste, M.: Recognizable languages in concurrency monoids. TCS 150, 77-109 (1995)
7. Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. I&C 204, 920-956 (2006)
8. Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-State High-Level MSCs: Model-Checking and Readability. Journal of Computer and System Sciences 72, 617-647 (2006)
9. Gunter, E.L., Muscholl, A., Peled, D.: Compositional message sequence charts. Intern. Journal on Software Tools for Technology Transfer 5(1), 78-89 (2003)
10. Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.S.: A Theory of Regular MSC Languages. I&C 202, 1-38 (2005)
11. Kuske, D.: Regular sets of infinite message sequence charts. I&C 187, 80-109 (2003)
12. Mukund, M., Narayan Kumar, K., Sohoni, M.: Bounded time-stamping in message-passing systems. TCS 290, 221-239 (2003)
13. Zielonka, W.: Safe executions of recognizable trace languages by asynchronous automata. In: Meyer, A.R., Taitslin, M.A. (eds.) Logic at Botik 1989. LNCS, vol. 363, pp. 278-289. Springer, Heidelberg (1989)