Kimmo Varpaaniemi. On the stubborn set method in reduced state space generation. Research Report A51, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, May 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....from suitably defined (using a notion of independence) equivalence classes of behaviors. Methods of this class include stubborn sets, persistent sets, and ample sets. Also closely related to these methods is the sleep set method. For more information on this class of methods, see e.g. [11, 30, 70, 72]. This work will concentrate on the second subclass of partial order methods Rather than being based on a partial order model of program execution, the methods use commutativity of (some) transitions to generate only part of the Kripke structure. This commutativity might not even arise from ....

K. Varpaaniemi. On the Stubborn Set Method in Reduced State Space Generation. PhD thesis, Helsinki University of Technology, Digital Systems Laboratory, May 1998.

.... of different temporal logics, differing in their expressive power, have been developed, but two logics in particular have been in wide spread use: Linear Temporal Logic (LTL) 47, 132] and Computation Tree Logic (CTL) 25] LTL is used, e.g. as query language in the SPIN [61, 118] and PROD [117, 134] tools. CTL is used, e.g. as query language in the SMV [93, 112] and PEP [51, 62] tools. 2.3. RELATED WORK 17 Temporal logic can also be used to express standard dynamic properties of a CPnet. Boundedness properties and dead transitions binding elements (transitions binding elements which can ....

K. Varpaaniemi. On The Stubborn Set Method in Reduced State Space Generation. PhD thesis, Helsinki University of Technology, 1998.

....For any candidate P , IMA computes such a set within O( jV j jV j) jF j#)jH j) elementary time units. The implementation of IMA for the needs of the stubborn set method of the high level Petri net reachability analysis tool PROD [16] concerning the case 8h 2 H : w(h) 1, is described in [14]. In that implementation, the candidates P H are processed in the order of increasing cardinality, and a solution to the instance of SOLIDOPTW in question is guaranteed whenever a solution of cardinality 1 exists or jH j 5. The experiments reported in [14] and the experience obtained so far ....

....8h 2 H : w(h) 1, is described in [14] In that implementation, the candidates P H are processed in the order of increasing cardinality, and a solution to the instance of SOLIDOPTW in question is guaranteed whenever a solution of cardinality 1 exists or jH j 5. The experiments reported in [14] and the experience obtained so far indicate the following. In some reachability analysis tasks, using IMA for the tasks reduces the total analysis times signi cantly when compared to any of the tried alternatives that are available in PROD for the same tasks. Though IMA has been used for ....

K. Varpaaniemi, On the Stubborn Set Method in Reduced State Space Generation (Doctoral thesis), Helsinki University of Technology, Digital Systems Laboratory Report A 51, 1998, 105 p.

....graphs of the net models were guaranteed to be nite. For a certain model where every queue had the capacity 2, the full reachability graph was still known to be too large to be generated in an operating system that had the above mentioned 32 bit problem. Fortunately, the stubborn set method [15, 16] in PROD successfully constructed a reduced reachability graph that suced for showing that the full reachability graph had no terminal state. However, even that construction took more than two days. Dropping all the queue capacities from 2 to 1 changed the situation dramatically: it took less than ....

....one element per time and one slot per time. With minimal additional guidance from the user, the stubborn set method in PROD is clever enough to avoid introducing redundant interleavings that would be due to the change in atomicity. PROD also has an option which eliminates intermediate states [16], such as the states where the queue is not in the normal form . The stubborn set method does not easily recognise redundant places, and so it is best to avoid such places. For example, imagine a high level place that keeps count of the number of tokens in another high level place while the only ....

[Article contains additional citation context not shown here]

Kimmo Varpaaniemi. On the Stubborn Set Method in Reduced State Space Generation. Doctoral thesis, Report A51, Digital Systems Laboratory, Helsinki University of Technology, 1998.

....of the 90 s and has been developed further since then. For PRENA and PROD, the model is given as a high level Petri net. Some methods for relieving the state space explosion problem have been implemented in PROD. Particular e ort has been put into the implementation of the stubborn set method [10, 11]. The stubborn set method belongs to the class of partial order methods and is based on the idea that one interleaving of actions is often sucient for representing several interleavings. At the end of the 90 s, the laboratory started to develop a new high level Petri net reachability analysis ....

Kimmo Varpaaniemi, On the Stubborn Set Method in Reduced State Space Generation, Doctoral thesis, Helsinki University of Technology, Digital Systems Laboratory Report A 51, Espoo, Finland, May 1998, 105 p.

....of a system can be far too large w.r.t. the resources needed to inspect all states in the state space. Fortunately, in a variety of cases we do not have to inspect all reachable states of the system in order to get to know whether or not errors of a specified kind exist. The stubborn set method [12, 13, 14, 15, 10], and the sleep set method [2] are state search techniques that are based on the idea that when two executions of action sequences are sufficiently similar to each other, it is not necessary to investigate both of the executions. Persistent sets [2] and ample sets [1, 7] are strikingly similar to ....

....encountered. Assuming that we want a mechanically computed answer to the question if terminal states exist in the complete state space, we can let the stubborn set method construct a reduced state space graph. The obtained space actually contains all the terminal states of the complete state space [12, 15]. Given any useful definition of stubbornness, it is likely if not provably at least NP hard [7] to find a cardinality minimal reduced state space among the the alternatives induced by the definition. No algorithm for finding such a minimum within a reasonable time has been presented either. ....

[Article contains additional citation context not shown here]

K. Varpaaniemi, On the Stubborn Set Method in Reduced State Space Generation, Doctoral thesis, Helsinki University of Technology, Digital Systems Laboratory Report A 51, 1998, 105 p.

No context found.

Kimmo Varpaaniemi. On the stubborn set method in reduced state space generation. Research Report A51, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, May 1998.

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