Pages that link to "Item:Q1608920"
From MaRDI portal
The following pages link to Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (Q1608920):
Displayed 14 items.
- A basic algebra of stateless connectors (Q860881) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- Maude: specification and programming in rewriting logic (Q1608917) (← links)
- Rewriting logic: Roadmap and bibliography (Q1615001) (← links)
- Observational congruences for dynamically reconfigurable tile systems (Q1782000) (← links)
- Executable structural operational semantics in Maude (Q2369036) (← links)
- A general framework for types in graph rewriting (Q2581012) (← links)
- Comparing cospan-spans and tiles via a Hoare-style process calculus (Q2841276) (← links)
- GS·Λ Theories (Q2842817) (← links)
- A Rewriting Logic Approach to Operational Semantics (Extended Abstract) (Q2871834) (← links)
- Graph-Based Design and Analysis of Dynamic Software Architectures (Q3507356) (← links)
- Linear-Ordered Graph Grammars: Applications to Distributed Systems Design (Q3507361) (← links)
- Models of Computation: A Tribute to Ugo Montanari’s Vision (Q3507385) (← links)
- 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 (Q4917051) (← links)