Rewriting logic as a semantic framework for concurrency: a progress report

DOI10.1007/3-540-61604-7_64zbMath1514.68175MaRDI QIDQ6104381

No author found.

Publication date: 28 June 2023

Published in: CONCUR '96: Concurrency Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (18)

Rewriting logic: Roadmap and bibliography ⋮ Entailment-based actions for coordination ⋮ José Meseguer: Scientist and Friend Extraordinaire ⋮ Two Decades of Maude ⋮ The rewriting logic semantics project: a progress report ⋮ Twenty years of rewriting logic ⋮ Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding ⋮ An overview of the K semantic framework ⋮ Programming and symbolic computation in Maude ⋮ A rewriting logic approach to operational semantics ⋮ Actor languages. Their syntax, semantics, translation, and equivalence ⋮ A causal semantics for CCS via rewriting logic ⋮ Maude: specification and programming in rewriting logic ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic ⋮ Specification of real-time and hybrid systems in rewriting logic ⋮ A Maude specification of an object-oriented model for telecommunication networks ⋮ Actor theories in rewriting logic

Cites Work

• The algorithmic analysis of hybrid systems
• The gamma model and its discipline of programming
• Petri nets are monoids
• Sequential and concurrent behaviour in Petri net theory
• Conditional rewriting logic as a unified model of concurrency
• The chemical abstract machine
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
• Axiomatizing the algebra of net computations and processes
• Contextual nets
• Graph expressions and graph rewritings
• Functions as processes
• An approach to object semantics based on terminal co-algebras
• Bi-rewriting, a term rewriting technique for monotonic order relations
• Relating two categorical models of term rewriting
• Set-theoretic graph rewriting
• CPO models for infinite term rewriting
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• 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

This page was built for publication: Rewriting logic as a semantic framework for concurrency: a progress report