Publication detail

State-space Model Based on Graph Rewriting

MAREK, V.

Original Title

State-space Model Based on Graph Rewriting

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

Many methods for model analyses and verifications are based on the state-space analysis of the model. While models usually have a finite representation, their state spaces are often infinite. This paper concentrates on a P/T Petri nets having exactly one place, which is a special subclass of P/T Petri nets, and shows how to represent infinite state space of a P/T Petri net in a finite way. For this purpose a concept of graph rewriting is used. Some interesting properties of this concept are studied and solution of reachability problem is shown.

Keywords

P/T Petri net, state space, graph grammar, finite representation of infinite state space.

Authors

MAREK, V.

Released

19. 4. 2004

Location

Ostrava

ISBN

80-85988-99-2

Book

Proceedings of 7th International Conference ISIM '04

Pages from

133

Pages to

140

Pages count

8

BibTex

@inproceedings{BUT18256,
  author="Vladimír {Marek}",
  title="State-space Model Based on Graph Rewriting",
  booktitle="Proceedings of 7th International Conference ISIM '04",
  year="2004",
  pages="133--140",
  address="Ostrava",
  isbn="80-85988-99-2"
}