In this paper we study how the framework of Petri nets can be extended and applied to study recurrent events. We use possibility theory to realistically model temporal properties o...
In [13], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfi...
While OWL-S advertisements provide a rich (ontological and behavioural) description of Web services, there are no tools that support formal analyses of OWL-S services. In this pape...
The concatenable processes of a Petri net N can be characterized ly as the arrows of a symmetric monoidal category P[N]. Yet, this is only a partial axiomatization, since P[N] is b...
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Key word...