메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 4337 LNCS, Issue , 2006, Pages 333-344
The meaning of ordered SOS
Author keywords

[No Author keywords available]
Indexed keywords

SOFTWARE ENGINEERING;
EID: 85017523357     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944836_31     Document Type: Conference Paper
Times cited : (5)
References (9)
  • 1
    • 0000265326 scopus 로고
    • Syntax and defining equations for an interrupt mechanism in process algebra
    • J. C. M. Baeten, J. A. Bergstra, J.W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. FundamentaInformaticae, XI(2):127–168, 1986.
    • (1986) Fundamentainformaticae , vol.11 , Issue.2 , pp. 127-168
    • Baeten, J.C.M.1    Bergstra, J.A.2    Klop, J.W.3
  • 2
    • 0024960726 scopus 로고
    • Term-rewriting systems with rule priorities
    • J. C. M. Baeten, J. A. Bergstra, J.W. Klop, and W. P. Weijland. Term-rewriting systems with rule priorities.TCS, 67(23):283–301, 1989.
    • (1989) TCS , vol.67 , Issue.2 , pp. 283-301
    • Baeten, J.C.M.1    Bergstra, J.A.2    Klop, J.W.3    Weijland, W.P.4
  • 3
    • 0029229420 scopus 로고
    • Bisimulation Can’t Be Traced
    • B. Bloom, S. Istrail and A.R. Meyer.Bisimulation Can’t Be Traced. JACM, 42(1):232–268, 1995.
    • (1995) JACM , vol.42 , Issue.1 , pp. 232-268
    • Bloom, B.1    Istrail, S.2    Meyer, A.R.3
  • 4
    • 0030231273 scopus 로고    scopus 로고
    • The meaning of negative premises in transition system specifications
    • R. Bol and J.F. Groote.The meaning of negative premises in transition system specifications.JACM, 43(5):863–914, 1996.
    • (1996) JACM , vol.43 , Issue.5 , pp. 863-914
    • Bol, R.1    Groote, J.F.2
  • 5
    • 2942582403 scopus 로고    scopus 로고
    • The meaning of negative premises in transition system specifications II
    • R.J.van Glabbeek.The meaning of negative premises in transition system specifications II.JLAP, 60-61:229–258, 2004.
    • (2004) JLAP , vol.60 , pp. 229-258
    • Van Glabbeek, R.J.1
  • 6
    • 0027666919 scopus 로고
    • Transition system specifications with negative premises
    • J.F. Groote.Transition system specifications with negative premises.TCS, 118(2): 263–299, 1993.
    • (1993) TCS , vol.118 , Issue.2 , pp. 263-299
    • Groote, J.F.1
  • 7
    • 4944243609 scopus 로고
    • A process algebra for timed systems
    • M. Hennessy and T. Regan.A process algebra for timed systems. IC, 117(2):221– 239, 1995.
    • (1995) IC , vol.117 , Issue.2
    • Hennessy, M.1    Regan, T.2
  • 8
    • 24644509896 scopus 로고    scopus 로고
    • Probabilistic congruence for semistochastic generative processes
    • LNCS, Springer
    • R. Lanotte and S. Tini. Probabilistic congruence for semistochastic generative processes. In Proceedings of FOSSACS’05, volume 3441 of LNCS, pages 63–78. Springer, 2005.
    • (2005) Proceedings of FOSSACS’05 , vol.3441 , pp. 63-78
    • Lanotte, R.1    Tini, S.2
  • 9
    • 0037057857 scopus 로고    scopus 로고
    • Ordered SOS Rules and Process Languages for Branching and Eager Bisimulations
    • I. Ulidowski and I.C.C. Phillips. Ordered SOS Rules and Process Languages for Branching and Eager Bisimulations. IC, 178(1):180–213, 2002.
    • (2002) IC , vol.178 , Issue.1 , pp. 180-213
    • Ulidowski, I.1    Phillips, I.C.C.2

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