129 search results - page 8 / 26 » Completeness Results for Linear Logic on Petri Nets |
APN
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we propose two new unfolding semantics for general Petri nets combining the concept of prime event structures with the idea of token flows developed in [11]. In contr...
APN
2010
Springer
13 years 7 months ago
2010
Springer
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing p...
FUIN
2008
13 years 7 months ago
2008
In this paper, we consider safe Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal ...
APN
2009
Springer
13 years 11 months ago
2009
Springer
We present a symbolic method for p-semiflow computation, based on zero-suppressed decision diagrams. Both the traditional explicit methods and our new symbolic method rely on Farka...
ACSD
2006
IEEE
14 years 1 months ago
2006
IEEE
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterminis...