메뉴 건너뛰기




Volumn 14, Issue , 1998, Pages 204-213

True concurrency = Interleaving concurrency + weak conflict

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER OPERATING SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; SEMANTICS; TURING MACHINES;

EID: 18944405442     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80237-3     Document Type: Conference Paper
Times cited : (5)

References (17)
  • 6
    • 26444611752 scopus 로고
    • Single pushout transformations of equationally defined graph structures with applications to actor systems
    • Springer Verlag
    • Korff M. Single pushout transformations of equationally defined graph structures with applications to actor systems. Proc. Graph Grammar Workshop Dagstuhl 93. Lecture Notes in Computer Science. 776:1994;234-247 Springer Verlag
    • (1994) Proc. Graph Grammar Workshop Dagstuhl 93. Lecture Notes in Computer Science , vol.776 , pp. 234-247
    • Korff, M.1
  • 7
    • 0013243841 scopus 로고
    • True concurrency semantics for single pushout graph transformations with applications to actor systems
    • R.J. Wieringa, & R.B. Feenstra. World Scientific
    • Korff M. True concurrency semantics for single pushout graph transformations with applications to actor systems. Wieringa R.J., Feenstra R.B. Information Systems - Correctness and Reusability. 1995;33-50 World Scientific
    • (1995) Information Systems - Correctness and Reusability , pp. 33-50
    • Korff, M.1
  • 9
    • 21344471591 scopus 로고    scopus 로고
    • Formal relationship between graph grammars and Petri nets
    • Korff M., Ribeiro L. Formal relationship between graph grammars and Petri nets. Lecture Notes in Computer Science. 1073:1996;288-303
    • (1996) Lecture Notes in Computer Science , vol.1073 , pp. 288-303
    • Korff, M.1    Ribeiro, L.2
  • 11
    • 0027558267 scopus 로고
    • Algebraic approach to single-pushout graph transformation
    • Löowe M. Algebraic approach to single-pushout graph transformation. Theoretical Computer Science. 109:1993;181-224
    • (1993) Theoretical Computer Science , vol.109 , pp. 181-224
    • Löowe, M.1
  • 13
    • 84974729920 scopus 로고
    • (organizer), the use of graph grammars in applications, Graph Grammars and Their Applications to Computer Science, Springer
    • Nagl M. (organizer), The use of graph grammars in applications, Graph Grammars and Their Applications to Computer Science, Springer. LNCS, Panel discussion. 532:1991;41-60
    • (1991) LNCS, Panel Discussion , vol.532 , pp. 41-60
    • Nagl, M.1
  • 14
    • 0042378858 scopus 로고    scopus 로고
    • A telephone system's specification using graph grammars
    • Technical University of Berlin
    • Ribeiro, L., A telephone system's specification using graph grammars, Tech. Report 96-23, Technical University of Berlin, 1996.
    • (1996) Tech. Report , vol.96 , Issue.23
    • Ribeiro, L.1


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