47 search results - page 3 / 10 » Decidability Problems in Petri Nets with Names and Replicati... |
ACTAC
2002
13 years 4 months ago
2002
: In this paper we study the home marking problem for Petri nets, and some related concepts to it like confluence, noetherianity, and state space inclusion. We show that the home m...
AC
2003
Springer
13 years 10 months ago
2003
Springer
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
DKE
2008
13 years 4 months ago
2008
We address the problem of analyzing the interaction between WS-BPEL processes. We present a technology chain that starts out with a WS-BPEL process and translates it into a Petri ...
DSS
2006
13 years 4 months ago
2006
Inspired by the way SAP R/3 and other transactional information systems log events, we focus on the problem to decide whether a process model and a frequency profile "fit"...