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
Year:
2002

Citing 2
Cited 3

Verification of non-functional properties of a composable architecture with Petri nets

Fundamenta Informaticae
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS

ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS

A method to prove non-reachability in priority duration Petri nets

Fundamenta Informaticae
Quantitative evaluation of time-dependent Petri nets and applications to biochemical networks

Natural Computing: an international journal
Modeling Group Scheduling Problems in Space and Time by Timed Petri Nets

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Non-reachability proofs in Timed Petrinets were usually done by proving the nonreachability 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.