Detail publikace
State-space Model Based on Graph Rewriting
MAREK, V.
Originální název
State-space Model Based on Graph Rewriting
Typ
článek ve sborníku mimo WoS a Scopus
Jazyk
angličtina
Originální abstrakt
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.
Klíčová slova
P/T Petri net, state space, graph grammar, finite representation of infinite state space.
Autoři
MAREK, V.
Vydáno
19. 4. 2004
Místo
Ostrava
ISBN
80-85988-99-2
Kniha
Proceedings of 7th International Conference ISIM '04
Strany od
133
Strany do
140
Strany počet
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"
}