McMillan’s complete prefix for contextual nets

McMillan’s complete prefix for contextual nets (2007)

Cached

Download Links

by Paolo Baldan , Andrea Corradini , Barbara König , Stefan Schwoon

Citations:

4 - 2 self

Versions

Version History

Metadata Version 2

User correction supplied by mph

Datum	Value	Source
TITLE	McMillan’s complete prefix for contextual nets	user correction
AUTHOR NAME	Paolo Baldan	user correction
AUTHOR AFFIL	Dipartimento di Matematica Pura e Applicata, Università di Padova	user correction
AUTHOR ADDR	Italy	user correction
AUTHOR NAME	Andrea Corradini	user correction
AUTHOR AFFIL		user correction
AUTHOR ADDR		user correction
AUTHOR NAME	Barbara König	user correction
AUTHOR AFFIL		user correction
AUTHOR ADDR		user correction
AUTHOR NAME	Stefan Schwoon	user correction
AUTHOR AFFIL		user correction
AUTHOR ADDR		user correction
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 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.	user correction
YEAR	2007	INFERENCE
CITATIONS	19 found	ParsCit 1.0