183 search results - page 10 / 37 » The Downward-Closure of Petri Net Languages |
JUCS
2002
14 years 9 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...
AC
2003
Springer
15 years 2 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...
ITCC
2003
IEEE
15 years 2 months ago
2003
IEEE
A multimedia server needs to satisfy the temporal ordering of multimedia data streams when servicing a client. Multimedia data has high bandwidth requirements, and within a networ...
118
click to vote
IS
2008
14 years 9 months ago
2008
In this paper we propose DFL -- a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated, and the structure of the ...
102
click to vote
ACSD
2008
IEEE
14 years 11 months ago
2008
IEEE
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...