47 search results - page 5 / 10 » Decidability Problems in Petri Nets with Names and Replicati... |
ACSD
2007
IEEE
14 years 18 days ago
2007
IEEE
In this paper we introduce executions of place/transition Petri nets with weighted inhibitor arcs (PTI-net) as enabled labeled stratified order structures (LSOs) and present a po...
IANDC
2002
13 years 6 months ago
2002
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all...
BPM
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. This paper addresses the problem of analyzing the interaction between BPEL processes. We present a technology chain that starts out with a BPEL process and transforms it ...
JUCS
2002
13 years 6 months ago
2002
: With any Petri net we associated its CPN language which consists of all sequences of transitions which reach a marking with an empty place whereas all proper prefixes of the sequ...
RP
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. In this paper we consider ν-MSR, a formalism that combines the two main existing approaches for multiset rewriting, namely MSR and CMRS. In ν-MSR we rewrite multisets o...