Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled tr...
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...