Detail výsledku

State-space Model Based on Graph Rewriting

MAREK, V. State-space Model Based on Graph Rewriting. Proceedings of 7th International Conference ISIM '04. Ostrava: Marq software s.r.o., 2004. p. 133-140. ISBN: 80-85988-99-2.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Marek Vladimír, Ing., FIT (FIT), UITS (FIT)
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.

Rok
2004
Strany
133–140
Sborník
Proceedings of 7th International Conference ISIM '04
Konference
7th International Conference on Information Systems Implementation and Modelling
ISBN
80-85988-99-2
Vydavatel
Marq software s.r.o.
Místo
Ostrava
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",
  publisher="Marq software s.r.o.",
  address="Ostrava",
  isbn="80-85988-99-2"
}
Projekty
Automatizované metody a nástroje pro vývoj spolehlivých paralelních a distribuovaných systémů, GAČR, Standardní projekty, GA102/04/0780, zahájení: 2004-01-01, ukončení: 2006-12-31, ukončen
Pracoviště
Ústav inteligentních systémů (UITS)
Nahoru