Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness

Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets

On Compositionality of Boundedness and Liveness for Nested Petri Nets

Nested Petri nets (NP-nets) are Petri nets with net tokens. The liveness and boundedness problems are undecidable for two-level NP-nets [10]. Boundedness is EXPSPACE and liveness is EXPSPACE or worse for plain Petri nets [4]. However, for some restricted classes, e.g. for plain free-choice Petri nets, problems become more amenable to analysis. There is the polynomial time algorithm to check if ...

Timing-dependent boundedness and liveness in continuous Petri nets

The very classical structural boundedness and repetitiveness properties for discrete and untimed models are reconsidered for timed continuous Petri nets (TCPN), under infinite server semantics. The timing is here involved in the analysis, by taking advantage of its matricial characterization and properties analogous to conservativeness and consistency are defined. It is shown that such properti...

Compositional analysis for regularity, liveness and boundedness

By the linear algebraic representation of Petri nets, Desel introduced regularity property (Desel, 1992). Regularity implies a sufficient condition for a Petri net to be live and bounded. All the conditions checking the regularity of a Petri net are decidable in polynomial time in the size of a net (Desel and Esparza, 1995). This paper proves that regularity, liveness and boundedness can be pre...

E:/Doctorat/Raport tehnic/teza.dvi

Preface The aim of the workflow management is to help business goals to be achieved with high efficiency by means of sequencing work activities and invoking appropriate resources associated to these activities. Therefore, workflow management is both a key technology in supporting business processes and an effective means to realize full or partial automation of a business process. Despite many ...