44 search results - page 1 / 9 » Separability in Persistent Petri Nets |
APN
2010
Springer
13 years 9 months ago
2010
Springer
We prove that plain, bounded, reversible and persistent Petri nets are weakly and strongly separable.
LICS
2006
IEEE
13 years 11 months ago
2006
IEEE
A compositional Petri net based semantics is given to a simple pointer-manipulating language. The model is then applied to give a notion of validity to the judgements made by conc...
ACTA
2007
13 years 5 months ago
2007
Abstract This paper introduces the notion of well-structured language. A wellstructured language can be defined by a labelled well-structured transition system, equipped with an u...
MMMACNS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. With the rise of global networks like the Internet the importance of workflow systems is growing. However, security questions in such environments often only address secu...
FUIN
2007
13 years 4 months ago
2007
The nets considered here are an extension of Petri nets in two aspects. In the semantical aspect, there is no one firing rule common to all transitions, but every transition is tr...