Realizability of dynamic MSC languages

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

Volumn 6072 LNCS, Issue , 2010, Pages 48-59

  Bollig, Benedikt ^a   Hélouët, Loïc ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATING AUTOMATA; EXPONENTIAL TIME; FINITE STATE MACHINES; MESSAGE SEQUENCE CHARTS; REALIZABILITY;

AUTOMATA THEORY; CELL CULTURE; COMPUTER SCIENCE;

FLOWCHARTING;

EID: 77954581078     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13182-0_5     Document Type: Conference Paper

References (13)

1. Adsul, B., Mukund, M., Narayan Kumar, K., Narayanan, V.: Causal closure for MSC languages. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 335-347. Springer, Heidelberg (2005)
2. Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. Theoretical Computer Science 331(1), 97-114 (2005)
3. Bollig, B., Hélouët, L.: Realizability of dynamic MSC languages. Research report, LSV, ENS Cachan (2010), http://www.lsv.ens-cachan. fr/Publis/
4. Bozzelli, L., La Torre, S., Peron, A.: Verification of well-formed communicating recursive state machines. Theoretical Computer Science 403(2-3), 382-405 (2008)
5. Brand, D., Zafiropulo, P.: On communicating finite-state machines. JACM 30(2) (1983)
6. Gazagnaire, T., Genest, B., Hélouët, L., Thiagarajan, P.S.,Yang, S.: Causalmessage sequence charts. Theor. Comput. Sci. 410(41), 4094-4110 (2009)
7. Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state high-level MSCs: Model-checking and realizability. Journal on Comp. and System Sciences 72(4), 617-647 (2006)
8. Gunter, E.L., Muscholl, A., Peled, D.: Compositional message sequence charts. STTT 5(1), 78-89 (2003)
9. Hélouët, L., Jard, C.: Conditions for synthesis of communicating automata from HMSCs. In: FMICS'00, pp. 203-224. Springer, Heidelberg (2000)
10. Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.S.: A theory of regular MSC languages. Information and Computation 202(1), 1-38 (2005)
11. Leucker, M., Madhusudan, P., Mukhopadhyay, S.: Dynamic message sequence charts. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 253-264. Springer, Heidelberg (2002)
12. Lohrey, M.: Realizability of high-level message sequence charts: closing the gaps. Theoretical Computer Science 309(1-3), 529-554 (2003)
13. Rudolph, E., Graubmann, P., Grabowski, J.: Tutorial on message sequence charts. Computer Networks and ISDN Systems 28(12), 1629-1641 (1996)