4 search results - page 1 / 1 » On the Computation of McMillan's Prefix for Contextual Nets ... |
124
click to vote
GG
2010
Springer
15 years 2 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...
112
click to vote
TOPNOC
2008
15 years 1 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 ...
108
click to vote
CONCUR
2004
Springer
15 years 6 months ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
122
click to vote
CONCUR
2000
Springer
15 years 5 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...