Computing minimal elements of upward-closed sets for Petri nets

Authors:
Hsu-Chun Yen;Chien-Liang Chen
Affiliations:
Dept. of Electrical Engineering, National Taiwan University, Taipei, Taiwan, Republic of China;Dept. of Electrical Engineering, National Taiwan University, Taipei, Taiwan, Republic of China
Venue:
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Year:
2007

Citing 9
Cited 0

A multiparameter analysis of the boundedness problem for vector addition systems

Journal of Computer and System Sciences
Parametric real-time reasoning

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Normal and sinkless Petri nets

Journal of Computer and System Sciences
A theory of timed automata

Theoretical Computer Science
Algorithmic analysis of programs with well quasi-ordered domains

Information and Computation - Special issue: LICS 1996—Part 1
Decidability and Complexity of Petri Net Problems - An Introduction

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Covering sharing trees: a compact data structure for parameterized verification

International Journal on Software Tools for Technology Transfer (STTT)
Timing parameter characterization of real-time systems

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Model checking lossy vector addition systems

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Upward-closed sets of integer vectors enjoy the merit of having a finite number of minimal elements, which is behind the decidability of a number of Petri net related problems. In general, however, such a finite set of minimal elements may not be effectively computable. In this paper, we develop a unified strategy for computing the sizes of the minimal elements of certain upward-closed sets associated with Petri nets. Our approach can be regarded as a refinement of a previous work by Valk and Jantzen (in which a necessary and sufficient condition for effective computability of the set was given), in the sense that complexity bounds now become available provided that a bound can be placed on the size of a witness for a key query. The sizes of several upward-closed sets that arise in the theory of Petri nets as well as in backward-reachability analysis in automated verification are derived in this paper, improving upon previous decidability results shown in the literature.