Rewriting as a unified model of concurrency

6Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

The lecture given at the workshop was based on recent work published elsewhere [9, 10, 8, 7]. This abstract gives a brief description of the main results and ideas presented in that work, but does not provide any technical details; such details can be found in the papers mentioned above.

References Powered by Scopus

Petri nets are monoids

256Citations
N/AReaders
Get full text

Chemical abstract machine

176Citations
N/AReaders
Get full text

Rewriting as a unified model of concurrency

70Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Verifying UML diagrams with model checking: A rewriting logic based approach

15Citations
N/AReaders
Get full text

Drags: A compositional algebraic framework for graph rewriting

8Citations
N/AReaders
Get full text

A formal framework for organization- centered multi-agent system specification: A rewriting logic based approach

7Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Meseguer, J. (1991). Rewriting as a unified model of concurrency. In Proceedings of the Workshop on Object-Based Concurrent Programming, OOPSLA/ECOOP 1990 (pp. 86–88). Association for Computing Machinery, Inc. https://doi.org/10.1145/127056.127091

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 9

60%

Professor / Associate Prof. 3

20%

Researcher 3

20%

Readers' Discipline

Tooltip

Computer Science 13

93%

Engineering 1

7%

Save time finding and organizing research with Mendeley

Sign up for free