메뉴 건너뛰기




Volumn 7810 LNCS, Issue , 2013, Pages 177-189

Dynamic communicating automata and branching high-level MSCs

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FLOWCHARTING;

EID: 84875653727     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-37064-9_17     Document Type: Conference Paper
Times cited : (9)

References (21)
  • 1
    • 15744383238 scopus 로고    scopus 로고
    • Realizability and verification of MSC graphs
    • DOI 10.1016/j.tcs.2004.09.034, PII S030439750400670X, Automata, Languages and Programming
    • Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. Theoretical Computer Science 331(1), 97-114 (2005) (Pubitemid 40415264)
    • (2005) Theoretical Computer Science , vol.331 , Issue.1 , pp. 97-114
    • Alur, R.1    Etessami, K.2    Yannakakis, M.3
  • 2
    • 84856637515 scopus 로고    scopus 로고
    • Context-bounded analysis for concurrent programs with dynamic creation of threads
    • Atig, M.F., Bouajjani, A., Qadeer, S.: Context-bounded analysis for concurrent programs with dynamic creation of threads. Logical Methods in Computer Science 7(4) (2011)
    • (2011) Logical Methods in Computer Science , vol.7 , Issue.4
    • Atig, M.F.1    Bouajjani, A.2    Qadeer, S.3
  • 4
    • 77954581078 scopus 로고    scopus 로고
    • Realizability of dynamic MSC languages
    • Ablayev, F., Mayr, E.W. (eds.) LNCS Springer, Heidelberg
    • Bollig, B., Héloüet, L.: Realizability of Dynamic MSC Languages. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, Vol. 6072, pp. 48-59. Springer, Heidelberg (2010)
    • (2010) CSR 2010 , vol.6072 , pp. 48-59
    • Bollig, B.1    Héloüet, L.2
  • 6
    • 48449099517 scopus 로고    scopus 로고
    • Verification of well-formed communicating recursive state machines
    • Bozzelli, L., La Torre, S., Peron, A.: Verification of well-formed communicating recursive state machines. Theoretical Computer Science 403(2-3), 382-405 (2008)
    • (2008) Theoretical Computer Science , vol.403 , Issue.2-3 , pp. 382-405
    • Bozzelli, L.1    La Torre, S.2    Peron, A.3
  • 7
    • 0020735797 scopus 로고
    • On communicating finite-state machines
    • Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM 30(2) (1983)
    • (1983) Journal of the ACM , vol.30 , Issue.2
    • Brand, D.1    Zafiropulo, P.2
  • 8
    • 33750983446 scopus 로고    scopus 로고
    • High-level petri nets as type theories in the join calculus
    • Foundations of Software Science and Computation Structures 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001 Proceedings
    • Buscemi, M.G., Sassone, V.: High-Level Petri Nets as Type Theories in the Join Calculus. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, Vol. 2030, pp. 104-120. Springer, Heidelberg (2001) (Pubitemid 33254625)
    • (2001) Lecture Notes in Computer Science , Issue.2030 , pp. 104-120
    • Buscemi, M.G.1    Sassone, V.2
  • 9
    • 84855204486 scopus 로고    scopus 로고
    • A Kleene theorem and model checking algorithms for existentially bounded communicating automata
    • DOI 10.1016/j.ic.2006.01.005, PII S0890540106000290
    • Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Information and Computation 204(6), 920-956 (2006) (Pubitemid 43744512)
    • (2006) Information and Computation , vol.204 , Issue.6 , pp. 920-956
    • Genest, B.1    Kuske, D.2    Muscholl, A.3
  • 11
    • 0012974485 scopus 로고    scopus 로고
    • Conditions for synthesis of communicating automata from HMSCs
    • Springer (2000)
    • Héloüet, L., Jard, C.: Conditions for synthesis of communicating automata from HMSCs. In: Proceedings of FMICS 2000, pp. 203-224. Springer (2000)
    • (2000) Proceedings of FMICS , pp. 203-224
    • Héloüet, L.1    Jard, C.2
  • 15
    • 0000673486 scopus 로고    scopus 로고
    • Series-parallel languages and the bounded-width property
    • Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. Theoretical Computer Science 237(1-2), 347-380 (2000)
    • (2000) Theoretical Computer Science , vol.237 , Issue.1-2 , pp. 347-380
    • Lodaya, K.1    Weil, P.2
  • 16
    • 0035895139 scopus 로고    scopus 로고
    • Rationality in algebras with a series operation
    • Lodaya, K., Weil, P.: Rationality in algebras with a series operation. Information and Computation 171(2), 269-293 (2001)
    • (2001) Information and Computation , vol.171 , Issue.2 , pp. 269-293
    • Lodaya, K.1    Weil, P.2
  • 17
    • 0242440296 scopus 로고    scopus 로고
    • Realizability of high-level message sequence charts: Closing the gaps
    • Lohrey, M.: Realizability of high-level message sequence charts: closing the gaps. Theoretical Computer Science 309(1-3), 529-554 (2003)
    • (2003) Theoretical Computer Science , vol.309 , Issue.1-3 , pp. 529-554
    • Lohrey, M.1
  • 18
    • 48249156600 scopus 로고    scopus 로고
    • On boundedness in depth in the π-calculus
    • Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds.) Springer, Boston
    • Meyer, R.: On Boundedness in Depth in the π-Calculus. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds.) Proceedings of IFIP TCS 2008, Vol. 273, pp. 477-489. Springer, Boston (2008)
    • (2008) Proceedings of IFIP TCS 2008 , vol.273 , pp. 477-489
    • Meyer, R.1
  • 20
    • 84937403715 scopus 로고    scopus 로고
    • Recognizable sets of message sequence charts
    • Alt, H., Ferreira, A. (eds.) LNCS Springer, Heidelberg
    • Morin, R.: Recognizable Sets of Message Sequence Charts. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, Vol. 2285, pp. 523-534. Springer, Heidelberg (2002)
    • (2002) STACS 2002 , vol.2285 , pp. 523-534
    • Morin, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.