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 for verification purposes. Contextual nets are a generalisation of Petri nets suited to model systems with readonly access to resources. When working with contextual nets, a finite complete prefix can be obtained by applying McMillan’s construction to a suitable encoding of the contextual net into an ordinary net. However, it has been observed that if the unfolding is itself a contextual net, then the complete prefix can be significantly smaller than the one obtained with the above technique. A construction for generating such a contextual complete prefix has been proposed for a special class of nets, called read-persistent. In this paper, we propose an algorithm that works for arbitrary semi-weighted, bounded contextual nets. The construction explicitly takes into account the fact that, unlike in ordinary or readpersistent nets, an event can have several different histories in general contextual net computations.
|Autori:||BALDAN PAOLO; CORRADINI A; KOENIG BARBARA; SCHWOON STEFAN|
|Titolo:||McMillan's complete prefix for contextual nets|
|Anno del prodotto:||2008|
|Digital Object Identifier (DOI):||10.1007/978-3-540-89287-8_12|
|Appare nelle tipologie:||1.1 Articolo in rivista|