Czasopismo
2002
|
Vol. 51, nr 1,2
|
235-250
Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Warianty tytułu
Języki publikacji
Abstrakty
Contextual nets, or Petri nets with read arcs, are models of concurrent systems with context dependent actions. The problem of reachability in such nets consists in finding a sequence of transitions that leads from the initial marking of a given contextual net to a given goal marking. The solution to this problem that is presented in this paper consists in constructing a finite complete prefix of the unfolding of the given contextual net, that is a finite prefix in which all the markings that are reachable from the initial marking are present, and in searching in each branch of this prefix for the goal marking by solving an appropriate linear programming problem.
Czasopismo
Rocznik
Tom
Strony
235-250
Opis fizyczny
bibliogr. 6 poz.
Twórcy
autor
- Instytut Podstaw Informatyki PAN, Ordona 21, 01-237 Warszawa, Poland, wink@ipipan.waw.pl
Bibliografia
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS2-0004-0032