941 search results - page 9 / 189 » Haskell-Coloured Petri Nets |
RP
2009
Springer
14 years 1 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 26 days 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...
ICRA
2003
IEEE
13 years 12 months 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...
CONCUR
1999
Springer
13 years 11 months ago
1999
Springer
We present several interpretations of the behavior of P/T nets in terms of traces, event structures, and partial orders. Starting from results of Hoogers, Kleijn and Thiagarajan, w...
LICS
2012
IEEE
11 years 9 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...