Analysis of simulation between Petri nets through rewriting logic

Yasuyuki Tahara, Shinichi Honiden

Research output: Contribution to journalArticle

Abstract

Rewriting logic has been proposed as a unified model of parallel and concurrent computation, especially concurrent object-oriented computation and agent oriented computation. In this paper, we present a category-theoretic technique in which simulation relation between concurrent processes described by rewriting logic is analyzed. In this technique, simulation relation is represented by morphisms in the category of concurrent processes. Moreover, this technique is shown to be applicable to Petri nets by modeling them by rewriting logic. By this method, it is acknowledged that our technique is applicable to Petri nets including multi-loops whose treatment is limited in other techniques.

Original languageEnglish
Pages (from-to)1498-1503
Number of pages6
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE78-A
Issue number11
Publication statusPublished - 1995 Nov 1
Externally publishedYes

Fingerprint

Rewriting Logic
Petri nets
Petri Nets
Concurrent
Simulation
Morphisms
Object-oriented
Modeling

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Analysis of simulation between Petri nets through rewriting logic. / Tahara, Yasuyuki; Honiden, Shinichi.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E78-A, No. 11, 01.11.1995, p. 1498-1503.

Research output: Contribution to journalArticle

@article{331cce7c4197498abedecf5c761404cf,
title = "Analysis of simulation between Petri nets through rewriting logic",
abstract = "Rewriting logic has been proposed as a unified model of parallel and concurrent computation, especially concurrent object-oriented computation and agent oriented computation. In this paper, we present a category-theoretic technique in which simulation relation between concurrent processes described by rewriting logic is analyzed. In this technique, simulation relation is represented by morphisms in the category of concurrent processes. Moreover, this technique is shown to be applicable to Petri nets by modeling them by rewriting logic. By this method, it is acknowledged that our technique is applicable to Petri nets including multi-loops whose treatment is limited in other techniques.",
author = "Yasuyuki Tahara and Shinichi Honiden",
year = "1995",
month = "11",
day = "1",
language = "English",
volume = "E78-A",
pages = "1498--1503",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "11",

}

TY - JOUR

T1 - Analysis of simulation between Petri nets through rewriting logic

AU - Tahara, Yasuyuki

AU - Honiden, Shinichi

PY - 1995/11/1

Y1 - 1995/11/1

N2 - Rewriting logic has been proposed as a unified model of parallel and concurrent computation, especially concurrent object-oriented computation and agent oriented computation. In this paper, we present a category-theoretic technique in which simulation relation between concurrent processes described by rewriting logic is analyzed. In this technique, simulation relation is represented by morphisms in the category of concurrent processes. Moreover, this technique is shown to be applicable to Petri nets by modeling them by rewriting logic. By this method, it is acknowledged that our technique is applicable to Petri nets including multi-loops whose treatment is limited in other techniques.

AB - Rewriting logic has been proposed as a unified model of parallel and concurrent computation, especially concurrent object-oriented computation and agent oriented computation. In this paper, we present a category-theoretic technique in which simulation relation between concurrent processes described by rewriting logic is analyzed. In this technique, simulation relation is represented by morphisms in the category of concurrent processes. Moreover, this technique is shown to be applicable to Petri nets by modeling them by rewriting logic. By this method, it is acknowledged that our technique is applicable to Petri nets including multi-loops whose treatment is limited in other techniques.

UR - http://www.scopus.com/inward/record.url?scp=0029408925&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029408925&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0029408925

VL - E78-A

SP - 1498

EP - 1503

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 11

ER -