6 search results - page 1 / 2 » On the Construction of Pullbacks for Safe Petri Nets |
APN
2006
Springer
13 years 8 months ago
2006
Springer
The product of safe Petri nets is a well known operation : it generalizes to concurrent systems the usual synchronous product of automata. In this paper, we consider a more general...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
– This paper addresses the problem of forbidden states of non safe Petri Net (PN) modelling discrete events systems. To prevent the forbidden states, it is possible to use condit...
CONCUR
2000
Springer
13 years 8 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
CONCUR
1992
Springer
13 years 9 months ago
1992
Springer
Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the "...
GG
2010
Springer
13 years 5 months ago
2010
Springer
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...