In: Proc. 8th Int. Workshop on Petri Net and Performance Models (PNPM'99), 8-10 October 1999, Zaragoza, Spain, pages 208-217. 1999.
Abstract: This paper aims to handle scenario durations of t-timed Petri nets without constructing the class graph. We use a linear logic characterization of scenarios based on the equivalence between reachability in Petri nets and provability of a class of linear logic sequence. In previous work, we have shown that it was possible to characterize a scenario with concurrency induced both by the Petri net structure and by the marking. But this approach is limited because some structural concurrency cannot be expressed. In this paper we develop a new approach which does not explicitly characterizes the scenario but its duration through an algebraic symbolic expression. It allows handling non safe Petri nets and structures which cannot be uniquely characterized by `sequence' and `parallel' operations.
Keywords: Petri nets, linear logic, scenario durations, sequence calculus.