Czasopismo
2000
|
Vol. 43, Nr 1-4
|
49-60
Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Warianty tytułu
Języki publikacji
Abstrakty
In this paper we define a certain class of process languages viewing processes as bi-partite graphs with an associative operation (sequential composition) on them. They describe finite evolutions of Petri nets. When extended to sets, we get an w-complete semiring such that rational, linear, and algebraic sets of such processes can be defined as least fixed points of systems of equations. With a norm of processes also iteration lemmata can be obtained. Finally, we also present a related structure of directed acyclic graphs.
Słowa kluczowe
Czasopismo
Rocznik
Tom
Strony
49-60
Opis fizyczny
bibliogr. 12 poz.
Twórcy
autor
autor
- Institute of Informatics Warsaw University ul. Banacha 2 02-097 Warsaw, Poland, lczaja@mimuw.edu.pl
Bibliografia
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS1-0008-0018