On the public citation graph

Rewriting as a unified model of concurrency

0 signed · 128 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-18420-1_50openalex-snapshot

Concurrent term rewriting as a model of computation

inferredcites →https://doi.org/10.1007/3-540-18508-9_23openalex-snapshot

Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms

inferredcites →https://doi.org/10.1007/3-540-19242-5_22openalex-snapshot

An introduction to OBJ 3

inferredcites →https://doi.org/10.1007/978-1-4471-3860-0_13openalex-snapshot

Formalizing the Behaviour of Parallel Object-Based Systems by Petri Nets

inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot

Categories for the Working Mathematician

inferredcites →https://doi.org/10.1007/978-1-4613-9668-0_6openalex-snapshot

Parallel Program Design

inferredcites →https://doi.org/10.1007/978-1-4899-0021-0openalex-snapshot

Toposes, Triples and Theories

inferredcites →https://doi.org/10.1007/bf01703261openalex-snapshot

Deductive systems and categories

inferredcites →https://doi.org/10.1007/bfb0018359openalex-snapshot

From petri nets to linear logic

inferredcites →https://doi.org/10.1007/bfb0019446openalex-snapshot

Net-based description of parallel object-based systems, or POTs and POPs

inferredcites →https://doi.org/10.1016/0890-5401(90)90013-8openalex-snapshot

Petri nets are monoids

inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot

Rewrite Systems

inferredcites →https://doi.org/10.1016/s0049-237x(08)70132-0openalex-snapshot

General Logics

inferredcites →https://doi.org/10.1090/conm/092openalex-snapshot

Categories in Computer Science and Logic

inferredcites →https://doi.org/10.1093/oso/9780198537601.003.0013openalex-snapshot

An algebraic axiomatization of linear logic models

inferredcites →https://doi.org/10.1109/lics.1988.5114openalex-snapshot

Petri nets are monoids: a new algebraic foundation for net theory

inferredcites →https://doi.org/10.1111/j.1746-8361.1969.tb01194.xopenalex-snapshot

Adjointness in Foundations

inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot

Initial Algebra Semantics and Continuous Algebras

inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot

Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

inferredcites →https://doi.org/10.1145/323648.323755openalex-snapshot

Extensions and foundations of object-oriented programming

inferredcites →https://doi.org/10.1145/96709.96717openalex-snapshot

The chemical abstract machine

inferredcites →https://doi.org/10.1145/97945.97958openalex-snapshot

A logical theory of concurrent objects

inferredcites →https://doi.org/10.21236/ada210528openalex-snapshot

The Rewrite Rule Machine Project

inferredcites →https://doi.org/10.7551/mitpress/1086.001.0001openalex-snapshot

Actors

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11780274_14openalex-snapshot

From OBJ to Maude and Beyond

inferred← citeshttps://doi.org/10.1007/3-540-45061-0_22openalex-snapshot

Generalized Rewrite Theories

inferred← citeshttps://doi.org/10.1007/3-540-48483-3_17openalex-snapshot

Using Reflection to Specify Transaction Sequences in Rewriting Logic

inferred← citeshttps://doi.org/10.1007/3-540-53932-8_53openalex-snapshot

Semantic specifications for the rewrite rule machine

inferred← citeshttps://doi.org/10.1007/3-540-54317-1_101openalex-snapshot

Compiling concurrent rewriting onto the Rewrite Rule Machine

inferred← citeshttps://doi.org/10.1007/3-540-54317-1_81openalex-snapshot

Conditional rewriting logic: Deduction, models and concurrency

inferred← citeshttps://doi.org/10.1007/3-540-55160-3_49openalex-snapshot

Parallel programming in maude

inferred← citeshttps://doi.org/10.1007/3-540-56379-2_33openalex-snapshot

Algebraic specification of concurrency

inferred← citeshttps://doi.org/10.1007/3-540-56689-9_46openalex-snapshot

Distributed implementation of CCS

inferred← citeshttps://doi.org/10.1007/3-540-57787-4_21openalex-snapshot

On relating rewriting systems and graph grammars to event structures

inferred← citeshttps://doi.org/10.1007/3-540-57867-6_15openalex-snapshot

Implementing inequality and nondeterministic specifications with bi-rewriting systems

inferred← citeshttps://doi.org/10.1007/3-540-57867-6_5openalex-snapshot

A SMoLCS based kit for defining high-level algebraic Petri nets

inferred← citeshttps://doi.org/10.1007/3-540-58025-5_66openalex-snapshot

Linear logic semantics for Concurrent Prolog

inferred← citeshttps://doi.org/10.1007/3-540-60954-7_50openalex-snapshot

An algebraic semantics of reflective objects

inferred← citeshttps://doi.org/10.1007/3-540-61487-7_26openalex-snapshot

Proofs, concurrent objects and computations in a FILL framework

inferred← citeshttps://doi.org/10.1007/3-540-61487-7_36openalex-snapshot

Formal semantics of agent evolution in language flage

inferred← citeshttps://doi.org/10.1007/3-540-61604-7_64openalex-snapshot

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

inferred← citeshttps://doi.org/10.1007/3-540-61629-2_34openalex-snapshot

On the role of category theory in the area of algebraic specifications

inferred← citeshttps://doi.org/10.1007/978-1-4615-3752-6_2openalex-snapshot

Architectural Design of the Rewrite Rule Machine Ensemble

inferred← citeshttps://doi.org/10.1007/978-1-4757-6541-0_5openalex-snapshot

Semantic Specifications for the Rewrite Rule Machine

inferred← citeshttps://doi.org/10.1007/978-3-030-54994-7_25openalex-snapshot

Statistical Model Checking of RANDAO’s Resilience to Pre-computed Reveal Strategies

inferred← citeshttps://doi.org/10.1007/978-3-031-31476-6_1openalex-snapshot

Strategies in Conditional Narrowing Modulo SMT Plus Axioms

inferred← citeshttps://doi.org/10.1007/978-3-0346-0145-0_25openalex-snapshot

Three Decades of Institution Theory

inferred← citeshttps://doi.org/10.1007/978-3-319-12904-4_4openalex-snapshot

Conditional Narrowing Modulo in Rewriting Logic and Maude

inferred← citeshttps://doi.org/10.1007/978-3-319-12904-4_7openalex-snapshot

Modelling and Verifying Contract-Oriented Systems in Maude

inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_1openalex-snapshot

José Meseguer: Scientist and Friend Extraordinaire

inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_11openalex-snapshot

Two Decades of Maude

inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_2openalex-snapshot

Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude

inferred← citeshttps://doi.org/10.1007/978-3-540-27815-3_39openalex-snapshot

Techniques for Executing and Reasoning about Specification Diagrams

inferred← citeshttps://doi.org/10.1007/978-3-540-31847-7_13openalex-snapshot

Functorial Semantics of Rewrite Theories

inferred← citeshttps://doi.org/10.1007/978-3-540-32128-6_3openalex-snapshot

Specifying DIMA Multi-agents Models Using Maude

inferred← citeshttps://doi.org/10.1007/978-3-540-44616-3_25openalex-snapshot

Towards a Verification Logic for Rewriting Logic

inferred← citeshttps://doi.org/10.1007/978-3-540-75132-8_13openalex-snapshot

Hierarchical Verification in Maude of LfP Software Architectures

inferred← citeshttps://doi.org/10.1007/978-3-642-13568-2_9openalex-snapshot

Rewriting Logic Based Performance Estimation of Embedded Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-16310-4_2openalex-snapshot

Twenty Years of Rewriting Logic

inferred← citeshttps://doi.org/10.1007/978-3-642-35864-7_56openalex-snapshot

Maude Specification Generation from VHDL

inferred← citeshttps://doi.org/10.1007/978-3-642-58117-5_30openalex-snapshot

Templates, Fragments and Skins

inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_10openalex-snapshot

Research Directions in Rewriting Logic

inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_7openalex-snapshot

Timed Rewriting Logic for the Specification of Time-Sensitive Systems

inferred← citeshttps://doi.org/10.1007/978-3-7091-6355-9_11openalex-snapshot

Truth — A verification platform for concurrent systems

inferred← citeshttps://doi.org/10.1007/bfb0013469openalex-snapshot

An algebra of graphs and graph rewriting

inferred← citeshttps://doi.org/10.1007/bfb0013826openalex-snapshot

Multiparadigm logic programming

inferred← citeshttps://doi.org/10.1007/bfb0014422openalex-snapshot

From abstract data types to logical frameworks

inferred← citeshttps://doi.org/10.1007/bfb0014438openalex-snapshot

An object-oriented airport: Specification and refinement in Maude

inferred← citeshttps://doi.org/10.1007/bfb0019446openalex-snapshot

Net-based description of parallel object-based systems, or POTs and POPs

inferred← citeshttps://doi.org/10.1007/bfb0019449openalex-snapshot

Graph grammar-based description of object-based systems

inferred← citeshttps://doi.org/10.1007/bfb0024172openalex-snapshot

Implementing parallel rewriting

inferred← citeshttps://doi.org/10.1007/s10817-017-9417-5openalex-snapshot

Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude

inferred← citeshttps://doi.org/10.1007/s12652-010-0016-0openalex-snapshot

Ambient intelligence in self-organising assembly systems using the chemical reaction model

inferred← citeshttps://doi.org/10.1007/s12652-012-0159-2openalex-snapshot

Self-organising assembly systems formally specified in Maude

inferred← citeshttps://doi.org/10.1016/0167-739x(95)00002-aopenalex-snapshot

A model for the parallel execution of subset-equational languages

inferred← citeshttps://doi.org/10.1016/0304-3975(92)90087-vopenalex-snapshot

An algebraic semantics for structured transition systems and its application to logic programs

inferred← citeshttps://doi.org/10.1016/0304-3975(92)90182-fopenalex-snapshot

Conditional rewriting logic as a unified model of concurrency

inferred← citeshttps://doi.org/10.1016/0304-3975(92)90186-jopenalex-snapshot

Observational structures and their logic

inferred← citeshttps://doi.org/10.1016/0304-3975(93)90240-topenalex-snapshot

A theory of binding structures and applications to rewriting

inferred← citeshttps://doi.org/10.1016/0304-3975(94)00073-ropenalex-snapshot

On the implementation of concurrent calculi in net calculi: two case studies

inferred← citeshttps://doi.org/10.1016/0890-5401(90)90013-8openalex-snapshot

Petri nets are monoids

inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.017openalex-snapshot

Equational Abstractions for Reducing the State Space of Rewrite Theories

inferred← citeshttps://doi.org/10.1016/j.entcs.2014.05.002openalex-snapshot

K Overview and SIMPLE Case Study

inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.10.005openalex-snapshot

Verifiable abstractions for contract-oriented systems

inferred← citeshttps://doi.org/10.1016/j.jlamp.2025.101048openalex-snapshot

A rewriting logic semantics for the analysis of P programs

inferred← citeshttps://doi.org/10.1016/j.jlap.2009.09.001openalex-snapshot

Quasi-boolean encodings and conditionals in algebraic specification

inferred← citeshttps://doi.org/10.1016/j.jlap.2010.03.012openalex-snapshot

An overview of the K semantic framework

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.04.012openalex-snapshot

Semantic foundations for generalized rewrite theories

inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00024-xopenalex-snapshot

Timed rewriting logic with an application to object-based specification

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00357-7openalex-snapshot

Rewriting logic: roadmap and bibliography

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00359-0openalex-snapshot

Maude: specification and programming in rewriting logic

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00361-9openalex-snapshot

Logical foundations of CafeOBJ

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00364-4openalex-snapshot

A Maude specification of an object-oriented model for telecommunication networks

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00365-6openalex-snapshot

Actor theories in rewriting logic

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00165-xopenalex-snapshot

Specification of abstract dynamic-data types: A temporal logic approach

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00031-3openalex-snapshot

Modelling Conditional Rewriting Logic in Structured Categories

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00034-9openalex-snapshot

Principles of Maude

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00047-7openalex-snapshot

An Actor Rewriting Theory

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00049-0openalex-snapshot

A Maude specification of an object-oriented database model for telecommunication networks

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00296-8openalex-snapshot

Knuth-Bendix Completion for Non-Symmetric Transitive Relations

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80354-2openalex-snapshot

Comparing Meseguer's Rewriting Logic with the Logic CRWL

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80123-9openalex-snapshot

Rewriting Logic as a Framework for Generic Verification Tools

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80126-4openalex-snapshot

New Foundations for Rewriting Logic

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80760-1openalex-snapshot

A Logic for Modular Descriptions of Asynchronous and Synchronized Concurrent Systems

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82530-7openalex-snapshot

Tiling Transactions in Rewriting Logic

inferred← citeshttps://doi.org/10.1017/s0960129501003462openalex-snapshot

Symmetric monoidal and cartesian double categories as a semantic framework for tile logic

inferred← citeshttps://doi.org/10.1017/s1471068406002845openalex-snapshot

A comparison between two logical formalisms for rewriting

inferred← citeshttps://doi.org/10.1023/a:1008688122154openalex-snapshot

Applications of Category Theory to the Area of Algebraic Specification in Computer Science

inferred← citeshttps://doi.org/10.1109/access.2019.2896947openalex-snapshot

Soft Set Theory for Decision Making in Computational Biology Under Incomplete Information

inferred← citeshttps://doi.org/10.1109/aiccsa.2010.5586987openalex-snapshot

For more understandable UML diagrams

inferred← citeshttps://doi.org/10.1109/fmpc.1992.234941openalex-snapshot

Simulation and performance estimation for the Rewrite Rule Machine

inferred← citeshttps://doi.org/10.1109/hicss.1993.284117openalex-snapshot

A metaarchitecture for distributed resource management

inferred← citeshttps://doi.org/10.1109/iceccs.2009.30openalex-snapshot

UML Modeling and Formal Verification of Control/Data Driven Embedded Systems

inferred← citeshttps://doi.org/10.1109/icm.2008.5393552openalex-snapshot

Maude- based design space exploration of embedded systems

inferred← citeshttps://doi.org/10.1109/isie.2010.5637273openalex-snapshot

Implementing self-organisation and self-management in evolvable assembly systems

inferred← citeshttps://doi.org/10.1109/iwrsp.1999.779032openalex-snapshot

Rapid prototyping of specification language implementations

inferred← citeshttps://doi.org/10.1109/rsp.2005.34openalex-snapshot

On the Use of Rewriting Logic for Verification of Distributed Software Architecture Description Based LfP

inferred← citeshttps://doi.org/10.1145/127056.127091openalex-snapshot

Rewriting as a unified model of concurrency

inferred← citeshttps://doi.org/10.1145/127070.127091openalex-snapshot

Rewriting as a unified model of concurrency

inferred← citeshttps://doi.org/10.1145/97945.97953openalex-snapshot

LO and behold! Concurrent structured processes

inferred← citeshttps://doi.org/10.1145/97945.97958openalex-snapshot

A logical theory of concurrent objects

inferred← citeshttps://doi.org/10.14236/ewic/vocs2008.26openalex-snapshot

On the Use of Real-Time Maude for Architecture Description and Verification: A Case Study

inferred← citeshttps://doi.org/10.21236/ada276506openalex-snapshot

Proof of Concept for the Rewrite Rule Machine: Interensemble Studies

inferred← citeshttps://doi.org/10.21236/ada300868openalex-snapshot

Object-Oriented Design and Specification.

inferred← citeshttps://doi.org/10.4304/jmm.5.5.501-513openalex-snapshot

Using UML as a Front-end for StreamIt Programs Verification and Generation

inferred← citeshttps://doi.org/10.5381/jot.2007.6.4.a2openalex-snapshot

Translating AUML Diagrams into Maude Specifications: A Formal Verification of Agents Interaction Protocols.

inferred← citeshttps://doi.org/10.5381/jot.2008.7.1.a1openalex-snapshot

Applying Model Checking to Concurrent UML Models.

inferred← citeshttps://doi.org/10.56415/csjm.v31.14openalex-snapshot

PN2Maude: An automatic tool to generate Maude specification for Petri net models

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.