Iteration lemmata for certain classes of word, trace and graph lenguages

• Autorzy: Kudlek M.
• Języki publikacji: EN

Abstrakty

EN

Using general iteraction lemmata for languages defined by rational, linear, and algebraic sys-tems of equations on w-complete semirings, it can be shown that such iteration lemmata hold for certain classes of word and trace languages, and for process algebra classes related to them. The basic operation has to be associative with a neutral element, and is extended to sets of elements, such that the structure defined by it together with union and 0 is an w-complete semiring. With this property rational, linear and algebraic systems of equations can be de-fined, having a unique minimal solution as least fixed points. To guarantee iteration lemmata for the corresponding rational, linear and algebraic classes, a norm on the structure has to exit, fulfilling some monotonicity on union and extended opera-tion on sets. This article is an extended version of the paper presented at the workshop CS&P'98 in Berlin, September 28-30, 1998.

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 1999
• Tom: Vol. 37, Nr 4
• Strony: 413--422
• Opis fizyczny: bibliogr. 6 poz.

Twórcy

autor

Kudlek M.

• Universität Hamburg Fachbereich Informatik Vogt-Kölln-Str. 30 D-22527 Hamburg, Ger-many,