Probability in Petri Nets

Authors:
Manfred Kudlek
Affiliations:
Fachbereich Informatik, Universität Hamburg, Vogt-Kölln-Str. 30, D-22527 Hamburg, Germany. E-mail: kudlek@informatik.uni-hamburg.de
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Year:
2005

Citing 7
Cited 0

Foundations of computing

Foundations of computing
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Toward a Formal Macroset Theory

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Introduction to probabilistic automata (Computer science and applied mathematics)

Introduction to probabilistic automata (Computer science and applied mathematics)
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Closure Properties of Multiset Language Families

Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.