Results 1 
4 of
4
A Technique of State Space Search Based on Unfolding
 Formal Methods in System Design
, 1992
"... Unfoldings of Petri nets provide a method of searching the state space of concurrent systems without considering all possible interleavings of concurrent events. A procedure is given for constructing the unfolding of a Petri net, terminating the construction when it is sufficient to represent all re ..."
Abstract

Cited by 62 (0 self)
 Add to MetaCart
Unfoldings of Petri nets provide a method of searching the state space of concurrent systems without considering all possible interleavings of concurrent events. A procedure is given for constructing the unfolding of a Petri net, terminating the construction when it is sufficient to represent all reachable markings. This procedure is applied to hazard and deadlock detection in asynchronous circuits. Examples are given of scalable systems with exponential size state spaces, but polynomial size unfoldings, including a distributed mutual exclusion ring circuit.
Efficient Verification of Parallel RealTime Systems
 In Costas Courcoubetis, editor, Computer Aided Verification
, 1997
"... This paper presents an efficient model checking algorithm for onesafe time Petri nets and a timed temporal logic. The approach is based on the idea of (1) using only differences of timing variables to be able to construct a finite representation of the set of all reachable states and (2) further r ..."
Abstract

Cited by 45 (10 self)
 Add to MetaCart
This paper presents an efficient model checking algorithm for onesafe time Petri nets and a timed temporal logic. The approach is based on the idea of (1) using only differences of timing variables to be able to construct a finite representation of the set of all reachable states and (2) further reducing the size of this representation by exploiting the concurrency in the net. This reduction of the state space is possible, because the considered lineartime temporal logic is stuttering invariant. The firings of transitions are only partially ordered by causality and a given formula
Token Ring Arbiters: An Exercise in Asynchronous Logic Design with Petri Nets
, 1995
"... Designing an asynchronous communication architecture in a VLSI system, we have the choice of either using a token ring or a bus. The token ring structure is often more reliable than the bus structure because of its pointtopoint interconnection. In this paper, we study two alternative token ring ar ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Designing an asynchronous communication architecture in a VLSI system, we have the choice of either using a token ring or a bus. The token ring structure is often more reliable than the bus structure because of its pointtopoint interconnection. In this paper, we study two alternative token ring arbitration protocols which we call Busy Ring Protocol (BRP) and Lazy Ring Protocol (LRP). Their performance evaluation shows that BRP allows better response time under higher request rates, while its major disadvantage is waste of activity, and hence power, if the request traffic is relatively low. We describe the design of speedindependent control circuits for these two ring protocols. The initial specification of the protocol made in a Petri net is refined to a Signal Transition Graph, which is further implemented into a logical circuit by recently developed methods. The logical circuit involves, as a standard component, a twoway mutual exclusion (ME) element. The arbiter designs have be...
On Model Checking for Petri Nets and a LinearTime Temporal Logic
, 1992
"... This paper presents an efficient model checking algorithm for Petri nets. It is based on the reduced state space generation where the result of the evaluation on the full state space and the reduced state space is identical. This reduction of the state spaces is possible, because (1) the firings ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
This paper presents an efficient model checking algorithm for Petri nets. It is based on the reduced state space generation where the result of the evaluation on the full state space and the reduced state space is identical. This reduction of the state spaces is possible, because (1) the firings of the transitions are only partially ordered by causality and a given formula, and (2) the order of firings of transitions not related by this partial order is irrelevant for the evaluation of the given formula.