메뉴 건너뛰기




Volumn 4, Issue C, 1996, Pages 1-19

Tiles, Rewriting Rules and CCS

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); MATHEMATICAL MODELS; STRUCTURED PROGRAMMING; SYNCHRONIZATION;

EID: 19144373167     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00030-1     Document Type: Article
Times cited : (16)

References (30)
  • 1
    • 84916554238 scopus 로고    scopus 로고
    • L. Aceto, B. Bloom, F.W. Vaandrager, Turning SOS Rules into Equations, Information and Computation 111 (1), pp. 1–52.
  • 4
    • 84916554237 scopus 로고    scopus 로고
    • A. Corradini, F. Gadducci, CPO Models for Infinite Term Rewriting, in Proc. AMAST'95, LNCS 936, 1995, pp. 368–384.
  • 5
    • 84916554236 scopus 로고    scopus 로고
    • A. Corradini, F. Gadducci, U. Montanari, Relating Two Categorical Models of Concurrency, in Proc. RTA'95, LNCS 914, 1995, pp. 225–240.
  • 7
    • 84916554235 scopus 로고    scopus 로고
    • A. Corradini, Term Rewriting, in Parallel, submitted.
  • 9
    • 84916554234 scopus 로고    scopus 로고
    • G. Ferrari, U. Montanari, Towards the Unification of Models for Concurrency, in Proc. CAAP'90, LNCS 431, 1990, pp. 162-176.
  • 10
    • 84916554233 scopus 로고    scopus 로고
    • F. Gadducci, On the Algebraic Approach to Concurrent Term Rewriting, PhD Thesis, Università di Pisa, Pisa. Technical Report TD-96-02, Department of Computer Science, University of Pisa, 1996.
  • 11
    • 84916554232 scopus 로고    scopus 로고
    • F. Gadducci, U. Montanari, Enriched Categories as Models of Computations, in Proc. Fifth Italian Conference on Theoretical Computer Science, ICTCS'95, World Scientific, 1996, pp. 1–24.
  • 12
    • 84916554231 scopus 로고    scopus 로고
    • F. Gadducci, U. Montanari, The Tile Model, Technical Report TR-96-27, Department of Computer Science, University of Pisa, 1996.
  • 22
    • 84916554230 scopus 로고    scopus 로고
    • K.G. Larsen, L. Xinxin, Compositionality Through an Operational Semantics of Contexts, in Proc. ICALP'90, LNCS 443, 1990, pp. 526-539.
  • 25
    • 84916554229 scopus 로고    scopus 로고
    • F. Moller, The Non-Existence of Finite Axiomatizations for CCS Congruences, in Proc. LICS'90, IEEE Press, 1990, pp. 142-153
  • 26
    • 84916554228 scopus 로고    scopus 로고
    • N. Martí-Oliet, J. Meseguer, Rewriting Logic as a Logical and Semantic Framework, SRI Technical Report, CSL-93-05, 1993.
  • 27
    • 84916554227 scopus 로고    scopus 로고
    • D. Park, Concurrency and Automata on Infinite Sequences, in Proc. Fifth G-I Conference, LNCS 104, 1981, pp. 167–183.
  • 28
    • 84916554226 scopus 로고    scopus 로고
    • G. Plotkin, A Structural Approach to Operational Semantics, Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
  • 29
    • 84916554225 scopus 로고    scopus 로고
    • A.J. Power, An Abstract Formulation for Rewrite Systems, in Proc. CTCS'89, LNCS 389, 1989, pp. 300-312.


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