Scenario analysis based on linear logic
Proceedings of the 2005 ACM SIGCHI International Conference on Advances in computer entertainment technology
Qualitative analysis of workflow nets using linear logic: soundness verification
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
A new graph of classes for the preservation of quantitative temporal constraints
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Time supervision of concurrent systems using symbolic unfoldings of time petri nets
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
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.