Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: duration nets

Sortuj według:

Ogranicz wyniki do:

Using State Equation to Prove Non-Reachability in Timed Petrinets

Popova-Zeugmann L., Werner M., Richling J.

Fundamenta Informaticae

2003

Vol. 55, nr 2

187-202

Non-reachability proofs in Timed Petrinets were usually done by proving the non-reachability within the underlying timeless net. However, in many cases this approach fails. In this paper, we present an approach to prove non-reachability within the actual Timed Petrinet. For this purpose, we introduce a state equation for Timed Petrinets in analogy to timeless nets. Using this state equation, we can express reachability as a system of equations and inequations, which is solvable in polynomial time.

Verification of Non-functional Properties of a Composable Architecture with Petrinets

Richling J., Popova-Zeugmann L., Werner M.

Fundamenta Informaticae

2002

Vol. 51, nr 1,2

185-200

In this paper, we introduce our concept of composability and present the MSS architecture as an example for a composable architecture. MSS claims to be composable with respect to timing properties. We discuss, how to model and prove properties in such an architecture with time-extended Petrinets. As a result, the first step of a proof of composability is presented as well as a new kind of Petrinet, which is more suitable for modeling architectures like MSS.