Comparing logics for rewriting: Rewriting logic, action calculi and tile logic

Theoretical Computer Science

Volumn 285, Issue 2, 2002, Pages 319-358

  Gadducci, Fabio ^a   Montanari, Ugo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

calculus; Action calculi; Algebraic theories; Concurrent systems; Gs monoidal theories; Interactive systems; Mobile systems; Rewriting logic; Term graphs; Tile logic

Indexed keywords

BOOLEAN ALGEBRA; CONCURRENT ENGINEERING; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; INTERACTIVE COMPUTER SYSTEMS;

ALGEBRAIC THEORIES; CONCURRENT SYSTEMS;

FORMAL LOGIC;

EID: 0037190146     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00362-0     Document Type: Article

References (76)

1. Explicit substitutions
2. From action calculi to linear logic
3. Multiple functors I: Limits relative to double categories
4. Process algebra for synchronous communication
5. The chemical abstract machine
6. An overview of ELAN
7. Normal forms for partitions and relations
8. Process and term tile logic
9. Executable tile specifications for process calculi
10. Symmetric and cartesian double categories as a semantic framework for tile logic
11. Cartesian closed double categories, their lambda-notation, and the pi-calculus
12. Zero-safe nets: Comparing the collective and individual token approaches
13. Internal strategies in a rewriting implementation of tile systems
14. Maude: Specification and programming in rewriting logic
15. Principles of Maude
16. Transition systems with algebraic structure as models of computations
17. A 2-categorical presentation of term graph rewriting
18. An algebraic presentation of term graphs, via gs-monoidal categories
19. Relating two categorical models of term rewriting
20. An algebraic semantics for structured transition systems and its application to logic programs
21. Towards a new algebraic foundation of flowchart scheme theory
22. A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
23. A distributed operational semantics for CCS based on condition/event systems
24. Axiomatizing the algebra of net computations and processes
25. Tile formats for located and mobile systems
26. Structured transition systems with parametric observations: Minimal realizations and observational congruences
27. The tile model
28. A name-free account of action calculi
29. Closed action calculi
30. Types and models for higher-order action calculi
31. On partial algebras
32. On partial recursive definitions and programs
33. An object calculus for asynchronous communication
34. Eine algebraisierung des syntheseproblemen von schaltkreisen, I und II
35. Computations in orthogonal rewriting systems, I
36. Semantics of weakening and contraction
37. Bicategories of processes
38. SPAN(Graph): A categorical algebra of transition systems
39. Formal verifications of parallel programs
40. Term rewriting systems
41. Doctrines in categorical logic
42. Equational reasoning with 2-dimensional diagrams
43. Axiomatizing permutation equivalence in the λ-calculus
44. Functorial semantics of algebraic theories
45. Optimal reductions in the lambda-calculus
46. Rewriting logic as a logical and semantic framework
47. Conditional rewriting logic as a unified model of concurrency
48. Rewriting logic as a semantic framework for concurrency: A progress report
49. Membership algebra as a logical framework for equational specification
50. Petri nets are monoids
51. Mapping tile logic into rewriting logic
52. Representation theorems for Petri nets
53. Higher-order action calculi
54. Calculi for interaction
55. Action structures and the π-calculus
56. A calculus of mobile processes, Part I and II
57. Notions of computation and monads
58. Concurrency and automata on infinite sequences
59. Categorical logic of names and abstraction in action calculi
60. A structural approach to operational semantics
61. Premonoidal categories and notions of computation
62. Bisimilarity of open terms
63. A theory of higher-order communicating systems