Using State Equation to Prove Non-Reachability in Timed Petrinets

Authors:
Louchka Popova-Zeugmann;Matthias Werner;Jan Richling
Affiliations:
Automata and System Theory Group, Department of Computer Science, Humboldt University, Germany;Communication and Operating Systems Group, Institute for Telecommunication Systems, TU Berlin, Germany;Computer Architecture and Communication Group, Department of Computer Science, Humboldt University, Germany
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Year:
2003

Citing 2
Cited 1

ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS

ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
Verification of Non-functional Properties of a Composable Architecture with Petrinets

Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)

A Method to Prove Non-Reachability in Priority Duration Petri Nets

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.