Probability in Petri Nets

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

Abstrakty

EN

It is demonstrated that the introduction of probability into Petri nets increases their power, in particular for their reachability sets. To achieve this the definition of accepted languages by probabilistic finite automata or probabilistic Turing machines with complexity restriction has to be modified.

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2005
• Tom: Vol. 67, nr 1-3
• Strony: 121--130
• Opis fizyczny: Bibliogr. 9 poz.

Twórcy

autor

Kudlek M.

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

Bibliografia

• [1] M. Abramowitz, I. A. Stegun : Handbook of Mathematical Functions. Dover, 1965.
• [2] F. Bause, P. S. Kritzinger : Stochastic Petri Nets. Vieweg, 1996.
• [3] J. Gruska : Foundations of Computing. International Thomson Computer Press, 1997.
• [4] M. Kudlek, C. Martín Vide, Gh. Pǎun : Toward FMT ( Formal Macroset Theory ). In Multiset Processing, eds. C. Calude, Gh. Pǎun, G. Rozenberg, A. Salomaa. LNCS 2235, pp 123-133, 2001.
• [5] M. Kudlek, V. Mitrana : Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Macrosets. In Multiset Processing, eds. C. Calude, Gh. Pǎun, G. Rozenberg, A. Salomaa. LNCS 2235, pp 135-146, 2001.
• [6] M. Kudlek, V. Mitrana : Closure Properties of Multiset Language Families. Fundamenta Informaticae, vol 49 (1-3), pp 219-283, 2002.
• [7] Gh. Pǎun : Membrane Computing - An Introduction. Springer, 2002.
• [8] A. Paz : Introduction to Probabilistic Finite Automata., Academic Press, 1971.
• [9] Gh. Pǎun, G. Rozenberg, A. Salomaa : DNA Computing. New Computing Paradigms, Springer-Verlag, Heidelberg, 1998.