D.K. Probst and H.F. Li. Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems. In Proceedings of the Second International Conference for Computer-Aided Verification. Lecture Notes in Computer Science, 531, June 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....on the data structure [Hud89] The problem of state explosion is widely studied in the analysis of Petri nets using a reachability graph. It has been tackled by numerous researchers in the verification community. Probst and Li describe partial order based models to circumvent this problem [PL90, PL91] Valmari presents an approach based on stubborn sets [Val89] which has been furthered in [VR92] The unfolding technique described by McMillan in [McM92] is quite appealing to keep the time and space requirements within practical bounds. In comparison with the existing approaches, the ....

D. K. Probst and H. F. Li. Using Partial Order Semantics to avoid the State Explosion Problem in Asynchronous Systems. In Proceedings of the Second Workshop on Computer-Aided Verification, CAV-90, 1990.

....would be useful. 13.5 Use partial orders to avoid the state explosion problem Automatic verification techniques that explore the entire state space of a system are often hindered by an explosion of states resulting from the many possible permutations of concurrent events. Several researchers [46, 61, 69, 78] have investigated verification methods that avoid this explosion by disregarding the order of independent events. Petri nets are a natural model for this approach, since they make independence of events explicit, but other concurrency models can be used. The behavior of a Petri net can be ....

D. K. Probst and H. F. Li. Using partial order semantics to avoid the state explosion problem in asynchronous systems. In Kurshan and Clarke [53].

....the focus of the partial order methods we discuss in this paper is purely on algorithmic issues, since we discuss fully automatic state space exploration techniques. The idea that the cost of modeling concurrency by interleaving can be avoided in finite state verification also appeared in [JK90, PL90, McM92, Esp94] In [JK90] the problem of finding an optimal reduced state space with just enough ON THE COSTS AND BENEFITS OF USING PARTIAL ORDER METHODS 3 transitions and states to preserve Mazurkiewicz s trace semantics is addressed. In [PL90] a method that relies on a pomset grammar ....

....finite state verification also appeared in [JK90, PL90, McM92, Esp94] In [JK90] the problem of finding an optimal reduced state space with just enough ON THE COSTS AND BENEFITS OF USING PARTIAL ORDER METHODS 3 transitions and states to preserve Mazurkiewicz s trace semantics is addressed. In [PL90] a method that relies on a pomset grammar description of the system is introduced. Also, in [McM92, Esp94] one finds a verification method that works by unfolding a Petri net description of a concurrent system into a finite acyclic structure. These methods are quite different from those ....

D. K. Probst and H. F. Li. Using partial-order semantics to avoid the state explosion problem in asynchronous systems. In Proc. 2nd Workshop on Computer Aided Verification, volume 531 of Lecture Notes in Computer Science, pages 146--155, Rutgers, June 1990. Springer-Verlag.

....[10] 15] attempt to generate and inspect all the protocol states that are reachable from given initial state(s) Such algorithms suffer from the state space explosion problem, especially for complex protocols. To circumvent this problem, state reduction and controlled partial search techniques [16] [17] could be used. These techniques focus only on parts of the state space and may use probabilistic [18] random [19] or guided searches [20] Work on distributed algorithms deals with synchronous networks, asynchronous shared memory and asynchronous networked systems [21] Proofs can be ....

D. Probst. Using partial-order semantics to avoid the state explosion problem in asynchronous systems. Proc. 2nd Workshop on ComputerAided Verification, Springer Verlag, New York, 1990.

....operations on the data structure [24, 25, 22] The problem of state explosion is ubiquitous in analysis of Petri nets using a reachability graph. It has been tackled by numerous researchers in the verification community. Probst and Li describe partial order based models to circumvent this problem [46, 47], and Valmari presents an approach based on stubborn sets [58] The unfolding technique described by McMillan in [37] is quite appealing to keep the time and space requirements within practical bounds. In comparison with the existing approaches, the pruning heuristic presented in this chapter is ....

Probst, D. K., and Li, H. F. Using Partial Order Semantics to avoid the State Explosion Problem in Asynchronous Systems. In Proceedings of the Second Workshop on Computer-Aided Verification, CAV-90 (1990).

....set method and Godefroid s sleep set method, the latter being called trace automaton method in [54] are ineffective in reducing the state explosion problem for asynchronous circuit models, because of the ubiquity of confusion in such models . The behaviour machine method of Probst and Li [61] also builds a representation of the partial orders of transitions and is also oriented to the verification of asynchronous circuit models. ffl Reduction rules can be used to transform a Petri net into a smaller net equivalent in some particular sense. Berthelot and Roucairol [3] Berthelot [2] ....

Probst, D.K. and Li, H.F.: Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems. In [13], pp. 146--155. -- 55 --

....space can be O(2 n ) n being the number of signals to define the state, this space can become extremely large even for moderate size asynchronous circuits. Several authors have proposed verification techniques to avoid the explicit enumeration of all the states: unfoldings [10] partial orders [13], symbolic model checking [3] and trace theory [5] among others. This paper presents sufficient conditions to automatically reduce the complexity of the circuit to be verified for speed independence. The proposed method aims at the reduction of the number of variables required for verification. It ....

David K. Probst and Hon F. Li. Using partial-order semantics to avoid the state explosion problem in asynchronous systems. In Robert P. Kurshan and Edmund M. Clarke, editors, Proc. Int. Workshop on CAV, volume 531 of Lecture Notes in Computer Science, pages 146--155. Springer-Verlag, 1990.

....to model checking based on partial order logics [PW84, KP86, Pen90] Indeed, these logics are designed to be semantically more powerful. We are only more efficient. The idea that the cost of modelling concurrency by interleaving can be avoided in finite state verification already appears in [PL90, Val91, Val90, God90] We build upon this earlier work, specifically that of [God90] and bring to it the full capabilities of model checking. We study model checking for linear time temporal logic and adopt the automata theoretic approach of [VW86, Var88, Wol89] In this approach, the program is ....

D. K. Probst and H. F. Li. Using partial-order semantics to avoid the state explosion problem in asynchronous systems. In Proc. 2nd Workshop on Computer Aided Verification, volume 531 of Lecture Notes in Computer Science, pages 146--155, Rutgers, June 1990.

....other hand, try to generate and inspect all the protocol states that are reachable from given initial state(s) Such algorithms suffer from the state space explosion problem, especially for complex protocols. To circumvent this problem, state reduction and controlled partial search techniques [23], 24] could be used. These techniques focus only on parts of the state space and may use probabilistic [25] random [26] or guided searches [27] We note that some of the reduction techniques use equivalence relations to prune away that part of the search proven to be irrelevant or redundant. ....

D. Probst. Using partial-order semantics to avoid the state explosion problem in asynchronous systems. Proc. 2nd Workshop on Computer-Aided Verification, Springer Verlag, New York, 1990.

....[15, 16] try to generate and inspect all the protocol states that are reachable from given initial state(s) Such algorithms suffer from the state space explosion problem, especially for complex protocols. To circumvent this problem, state reduction and controlled partial search techniques [17, 18] could be used. These techniques focus only on parts of the state space and may use probabilistic [19] random [20] or guided searches [21] In section 3.1 we outline the main characteristics of protocol verification approaches, and discuss the adequacy of these approaches for the verification of ....

D. Probst. Using partial-order semantics to avoid the state explosion problem in asynchronous systems. Proc. 2nd Workshop on Computer-Aided Verification, Springer Verlag, New York, 1990.

....by Safety and Buechi automata is presented. In safety proofs a mapping between states with the same external behaviour is searched, while in liveness proofs the mappings of the accepting states are always placed on traces that pass an accepting state later. A Partial Order semantic is used in [PL91] Behaviours described as pomtrees are mapped to behaviour machines that can be investigated. A method to prove ternary system model based specifications by bisimulation is presented in [BS91] Petri Nets are used for analysis of distributed systems too [Mer76, Mer79] Ideas to solve the ....

David K. Probst and Hon F. Li. Using partial-order semantics to avoid the state explosion problem in asynchronous systems. In Clarke and Kurshan [CK91], pages 146--155.

....packets down shared tree. 4) Packets down shared tree are accepted from LAN re registered forming a loop. Figure 12: The register scenarios under study cially in complex systems as are multiparty protocols. To circumvent this problem, state reduction and controlled partial search techniques [31, 32] could be used. These techniques focus only on parts of the state space and may use probabilistic [33] random [34] or guided searches [35] The SPIN tool [36] uses the supertrace algorithm that is actually a random controlled partial search. STRESS has similarities with guided controlled partial ....

D. Probst. Using partial-order semantics to avoid the state explosion problem in asynchronous systems. Proc. 2nd Workshop on Computer-Aided Verification, Springer Verlag, New York, 1990.

....other hand, try to generate and inspect all the protocol states that are reachable from given initial state(s) Such algorithms suffer from the state space explosion problem, especially for complex protocols. To circumvent this problem, state reduction and controlled partial search techniques [26, 27] could be used. These techniques focus only on parts of the state space and may use probabilistic [28] random [29] or guided searches [30] Reduced reachability analysis has been used in the verification of cache coherence protocols [31] using a global FSM (finite state machine) model. We adopt ....

D. Probst. Using partial-order semantics to avoid the state explosion problem in asynchronous systems. Proc. 2nd Workshop on Computer-Aided Verification, Springer Verlag, New York, 1990.

....and inspect all the protocol states that are reachable from given initial state(s) Such algorithms suffer from the state space explosion problem, especially in complex systems as are multiparty protocols. To circumvent this problem, state reduction and controlled partial search techniques [30, 31] could be used. These techniques focus only on parts of the state space and may use probabilistic [32] random [33] or guided searches [34] The SPIN tool [35] uses the supertrace algorithm that is actually a random controlled partial search. STRESS has similarities with guided controlled partial ....

D. Probst. Using partial-order semantics to avoid the state explosion problem in asynchronous systems. Proc. 2nd Workshop on Computer-Aided Verification, Springer Verlag, New York, 1990.

....or considering the actions to be unordered, the state explosion can be reduced. Examples of such techniques are the stubborn sets method of Valmari (1989; 1990) the trace automaton method of Godefroid and Wolper (Godefroid, 1990; Godefroid and Wolper, 1991) the behavior machines method of Probst and Li (1990), and the Time Petri Nets method of Yoneda et al. 1989) These methods are limited in that they only address one source of the state explosion problem the interleaving of concurrent actions. They are not effective, for example, on synchronous finite state machines, which do not involve ....

Probst, D. K. and Li, H. F. (1990). Using partial order semantics to avoid the state explosion problem in asynchronous systems. In (Kurshan and Clarke, 1990). Also in Springer-Verlag LNCS 531.

....though in general the size of the BDDs can grow as fast as the number of states in the system. These techniques have been applied to certain kinds of circuits, some standard concurrency problems such as the dining philosophers, and recently to a cache coherence protocol. Partial order techniques [13, 18, 21] identify transitions that commute (have the same effect if performed in either order) and use this information to reduce the number of states explored by not differentiating equivalent interleavings of transitions. These techniques excel at analyzing systems in which the state explosion results ....

D. K. Probst and H. F. Li. Using partial-order semantics to avoid the state explosion problem in asynchronous systems. In Clarke and Kurshan [9], pages 15--24.

....properties for a particular class of Petri nets. The simplification relies on a kind of reachability relation on computations. The approach of [26] is based on unfoldings of Petri nets that make it easier to establish reachability, but it does not preserve semantic equivalences. In the solution of [33] the user must supply an ad hoc pomset grammar (constructed by hand) which describes the behaviour of the considered system. Thus, it is not automatic as the other methods. The paper is organized as follows. Section 2 recalls the basic notions of proved transition sytems and introduces some ....

D.K. Probst and H.F. Li. Using partial order semantics to avoid the state explosion problem in asynchronous systems. In Proceedings of CAV'90, 1990.

....them, the method presented by [16] has been developed for a particular class of Petri nets. The simplification relies on a kind of reachability relation on computations. The approach of [18] is based on unfoldings of Petri nets that make it easier to establish reachability. In the solution by [23] the user must supply a pomset grammar which describes the behaviour of the considered net. The paper is organized as follows. In the next section we recall transition systems with independence [17] and we impose further restrictions on them. Subsection 2.1 describes how to reduce the size of ....

D.K. Probst and H.F. Li. Using partial order semantics to avoid the state explosion problem in asynchronous systems. In Proceedings of CAV'90, 1990.

....methods: those based on selectively constructing the interleavings of concurrent events. There are other approaches. For instance, in [McM92] one finds a verification method that works by unfolding a Petri net description of the concurrent system into a finite acyclic structure. Also, in [PL89, PL90] a method that relies on a pomset grammar description of the system is introduced. ....

D. K. Probst and H. F. Li. Using partial-order semantics to avoid the state explosion problem in asynchronous systems. In Proc. 2nd Workshop on Computer Aided Verification, volume 531 of Lecture Notes in Computer Science, pages 146--155, Rutgers, June 1990. Springer-Verlag.

....requires a richer structure than a search tree one that represents both a partial order on moves or transitions, and choice, or bifurcation in A TECHNIQUE OF STATE SPACE SEARCH BASED ON UNFOLDING 3 the search. One such structure, called a pomtree, has been invented by Probst and Li [10] [11], 12] and has been used in the verification of asynchronous circuits. Another framework for a partially ordered analysis has been provided by Nielsen, Plotkin and Winskel [9] They describe the unfolding of a model called a Petri net into an infinite net of a restricted form called an ....

D. K. Probst and H. F. Li. Using partial order semantics to avoid the state explosion problem in asynchronous systems. In Workshop on Computer Aided Verification, 1990.

No context found.

D.K. Probst and H.F. Li. Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems. In Proceedings of the Second International Conference for Computer-Aided Verification. Lecture Notes in Computer Science, 531, June 1990.

No context found.

D. K. Probst and H. F. Li. Using partial-order semantics to avoid the state explosion problem in asynchronous systems. In Proc. 2nd Workshop on Computer Aided Verification, volume 531 of Lecture Notes in Computer Science, pages 146--155, Rutgers, June 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC