메뉴 건너뛰기




Volumn 29, Issue , 1999, Pages 80-100

A bi-categorical axiomatisation of concurrent graph rewriting

Author keywords

[No Author keywords available]

Indexed keywords

BI-CATEGORICAL AXIOMATISATION; CONCURRENT GRAPH REWRITING; DOUBLE-PUSHOUT (DPO) GRAPH REWRITING; GRAPH TRANSFORMATION;

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

References (31)
  • 10
    • 0026909667 scopus 로고
    • An algebraic semantics for structured transition systems and its application to logic programs
    • Corradini A., Montanari U. An algebraic semantics for structured transition systems and its application to logic programs. Theoret. Comput. Sci. 103:1992;51-106
    • (1992) Theoret. Comput. Sci. , vol.103 , pp. 51-106
    • Corradini, A.1    Montanari, U.2
  • 12
    • 0031571058 scopus 로고    scopus 로고
    • Monoidal bicategories and Hopf algebroids
    • Day B., Street R.H. Monoidal bicategories and Hopf algebroids. Advances in Mathematics. 129:1997;99-157
    • (1997) Advances in Mathematics , vol.129 , pp. 99-157
    • Day, B.1    Street, R.H.2
  • 15
    • 85035052547 scopus 로고
    • Graph-grammars: An algebraic approach
    • R.V. Book. IEEE Computer Society Press
    • Ehrig H., Pfender M., Schneider H.J. Graph-grammars: an algebraic approach. Book R.V. Switching and Automata Theory. 1973;167-180 IEEE Computer Society Press
    • (1973) Switching and Automata Theory , pp. 167-180
    • Ehrig, H.1    Pfender, M.2    Schneider, H.J.3
  • 19
    • 0003898422 scopus 로고    scopus 로고
    • Open Graph Transformation Systems: A New Approach to the Compositional Modelling of Concurrent and Reactive Systems
    • Heckel R. Open Graph Transformation Systems: A New Approach to the Compositional Modelling of Concurrent and Reactive Systems. PhD thesis, Technische Universität Berlins. 1998
    • (1998) PhD Thesis, Technische Universität Berlins
    • Heckel, R.1
  • 25
    • 0027113376 scopus 로고
    • Conditional rewriting logic as a unified model of concurrency
    • Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci. 96:1992;73-155
    • (1992) Theoret. Comput. Sci. , vol.96 , pp. 73-155
    • Meseguer, J.1
  • 27
    • 84996131868 scopus 로고
    • An abstract formulation for rewrite systems
    • D.H. Pitt, D.E. Rydehard, P. Dybjer, A.M. Pitts, & A. Poigné. Springer Verlag
    • Power A.J. An abstract formulation for rewrite systems. Pitt D.H., Rydehard D.E., Dybjer P., Pitts A.M., Poigné A. Category Theory and Computer Science, volume 389 of LNCS. 1989;300-312 Springer Verlag
    • (1989) Category Theory and Computer Science, Volume 389 of LNCS , pp. 300-312
    • Power, A.J.1
  • 29
    • 85034640500 scopus 로고
    • Foundations of equational deductions: A categorical treatment of equational proofs and unification algorithms
    • D.H. Pitt, A. Poigne, & D.E. Rydehard. Springer Verlag
    • Rydehard D.E., Stell E.G. Foundations of equational deductions: A categorical treatment of equational proofs and unification algorithms. Pitt D.H., Poigne A., Rydehard D.E. Category Theory and Computer Science, volume 283 of LNCS. 1987;114-139 Springer Verlag
    • (1987) Category Theory and Computer Science, Volume 283 of LNCS , pp. 114-139
    • Rydehard, D.E.1    Stell, E.G.2
  • 31
    • 0003095409 scopus 로고    scopus 로고
    • Categorical structures
    • M. Hazewinkel. Elsevier
    • Street R.H. Categorical structures. Hazewinkel M. Handbook of Algebra. 1996;529-577 Elsevier
    • (1996) Handbook of Algebra , pp. 529-577
    • Street, R.H.1


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