Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
From MaRDI portal
Publication:1608920
DOI10.1016/S0304-3975(01)00362-0zbMath1001.68056MaRDI QIDQ1608920
Publication date: 13 August 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
calculusconcurrent systemsalgebraic theoriesinteractive systemsmobile systemsrewriting logicaction calculitile logicgs-monoidal theoriesterm graphs
Related Items
Rewriting logic: Roadmap and bibliography, Executable structural operational semantics in Maude, A basic algebra of stateless connectors, A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA)., Graph-Based Design and Analysis of Dynamic Software Architectures, Linear-Ordered Graph Grammars: Applications to Distributed Systems Design, Models of Computation: A Tribute to Ugo Montanari’s Vision, Observational congruences for dynamically reconfigurable tile systems, Comparing cospan-spans and tiles via a Hoare-style process calculus, GS·Λ Theories, A general framework for types in graph rewriting, A Rewriting Logic Approach to Operational Semantics (Extended Abstract), Dynamic connectors for concurrency, Maude: specification and programming in rewriting logic
Uses Software
Cites Work
- Bicategories of processes
- Notions of computation and monads
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Petri nets are monoids
- A distributed operational semantics of CCS based on condition/event systems
- A calculus of communicating systems
- Conditional rewriting logic as a unified model of concurrency
- The chemical abstract machine
- A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
- A calculus of mobile processes. II
- An algebraic semantics for structured transition systems and its application to logic programs
- Semantics of weakening and contraction
- A theory of higher order communicating systems
- Closed action calculi
- Maude: specification and programming in rewriting logic
- Zero-safe nets: Comparing the collective and individual token approaches.
- Tile formats for located and mobile systems.
- Bisimilarity of open terms.
- Calculi for interaction
- Axiomatizing the algebra of net computations and processes
- An algebraic presentation of term graphs, via gs-monoidal categories
- Process algebra for synchronous communication
- Formal verification of parallel programs
- Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
- Structured transition systems with parametric observations: observational congruences and minimal realizations
- Premonoidal categories and notions of computation
- Categorical logic of names and abstraction in action calculi
- Explicit substitutions
- Relating two categorical models of term rewriting
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- Rewriting logic as a semantic framework for concurrency: a progress report
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
