Rational, Linear and algebraic process languages and iteration lemmata

• Autorzy: Czaja L. , Kudlek M.
• Języki publikacji: EN

Abstrakty

EN

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

EN

formal languages; iteration lemmata; process; Petri net

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2000
• Tom: Vol. 43, Nr 1-4
• Strony: 49--60
• Opis fizyczny: bibliogr. 12 poz.

Twórcy

autor

Czaja L.

autor

Kudlek M.

• Institute of Informatics Warsaw University ul. Banacha 2 02-097 Warsaw, Poland,