메뉴 건너뛰기




Volumn 2949, Issue , 2004, Pages 38-54

On calculi for context-aware coordination

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; MULTI AGENT SYSTEMS; PATHOLOGY; PEER TO PEER NETWORKS;

EID: 33745794745     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24634-3_6     Document Type: Article
Times cited : (14)

References (10)
  • 2
    • 23044533092 scopus 로고    scopus 로고
    • State- and event-based reactive programming in shared dataspaces
    • th Int. Conf. on Coordination Models and Languages, Springer
    • th Int. Conf. on Coordination Models and Languages, LNCS 2315. Springer, 2002.
    • (2002) LNCS , vol.2315
    • Busi, N.1    Rowstron, A.2    Zavattaro, G.3
  • 3
    • 84947919695 scopus 로고    scopus 로고
    • Mobile ambients
    • M. Nivat, editor, Proc. of the 1st Int. Conf. on Foundations of Software Science and Computation Structures (FoSSaCS'98), Springer
    • L. Cardelli and A. D. Gordon. Mobile ambients. In M. Nivat, editor, Proc. of the 1st Int. Conf. on Foundations of Software Science and Computation Structures (FoSSaCS'98), LNCS 1378, pages 140-155. Springer, 1998.
    • (1998) LNCS , vol.1378 , pp. 140-155
    • Cardelli, L.1    Gordon, A.D.2
  • 4
    • 0027666919 scopus 로고
    • Transition system specifications with negative premises
    • J. F. Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118(2):263-299, 1993.
    • (1993) Theoretical Computer Science , vol.118 , Issue.2 , pp. 263-299
    • Groote, J.F.1
  • 5
    • 0000198242 scopus 로고
    • Structured operational semantics and bisimulation as a congruence
    • J. F. Groote and F. W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202-260, 1992.
    • (1992) Information and Computation , vol.100 , Issue.2 , pp. 202-260
    • Groote, J.F.1    Vaandrager, F.W.2
  • 6
    • 84885204671 scopus 로고    scopus 로고
    • Deriving bisimulation congruences for reactive systems
    • C. Palamidessi, editor, Proc. of the Int. Conf. on Concurrency Theory (CONCUR 2000), Springer
    • J. J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In C. Palamidessi, editor, Proc. of the Int. Conf. on Concurrency Theory (CONCUR 2000), LNCS 1187, pages 243-258. Springer, 2000.
    • (2000) LNCS , vol.1187 , pp. 243-258
    • Leifer, J.J.1    Milner, R.2
  • 7
    • 0027113376 scopus 로고
    • Conditional rewriting logic as a unified model of concurrency
    • José Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73-155, 1992.
    • (1992) Theoretical Computer Science , vol.96 , Issue.1 , pp. 73-155
    • Meseguer, J.1
  • 10


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