3 search results - page 1 / 1 » McMillan's Complete Prefix for Contextual Nets |
TOPNOC
2008
13 years 4 months ago
2008
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
GG
2010
Springer
13 years 6 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...
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...