969 search results - page 18 / 194 » Recursive Petri nets |
RP
2009
Springer
14 years 2 months ago
2009
Springer
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...
ICSOC
2007
Springer
14 years 1 months ago
2007
Springer
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...
FCT
1995
Springer
13 years 11 months ago
1995
Springer
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...
TCS
2008
13 years 7 months ago
2008
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...
ICRA
2003
IEEE
14 years 25 days ago
2003
IEEE
- In this paper, we propose a unitary tool for modeling and analysis of discrete event systems monitoring. Uncertain knowledge of such tasks asks specific reasoning and adapted fuz...