W. J. Yeh. Controlling State Explosion in Reachability Analysis. PhD thesis, Software Engineering Research Center (SERC) Laboratory, Purdue University, December 1993. Technical Report SERC-TR-147-P.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the Lts of each process separately may lead to state explosion, whereas the generation of the whole system of concurrent processes might succeed if processes constrain each other when composed in parallel. This issue has been addressed by re ned compositional veri cation approaches [GS90, CK93, Yeh93, CK95, CK96, GSL96, KM97, Che98, Gia99] which allow to generate the Lts of each separate process by taking into account interface constraints (also known as environment constraints or context constraints) These constraints express the behavioral restrictions imposed on each process by ....

W. J. Yeh. Controlling State Explosion in Reachability Analysis. PhD thesis, Software Engineering Research Center (SERC) Laboratory, Purdue University, December 1993. Technical Report SERC-TR-147-P.

.... on Taylor s concurrency history graph concept [29] and on the task interaction graph model (TIG) of Long and Clarke [15] the tasking deadlock detection method of Masticola and Ryder [16] the temporal logic based techniques of Karam and Buhr [14] the process algebra based method of Yeh and Young [33, 34], and the Petri net based methods used in the tasking oriented toolkit for the Ada language (TOTAL) 21, 26] Because of the computational complexity of concurrency analysis, in general all existing approaches appear to be very sensitive to the size of the program being analyzed in terms of the ....

....butler are analyzed, one with deadlock and the other without deadlock. The largest butler problem analyzed has 40 philosophers and 81 tasks. In [6] Corbett discusses enhancements to the constrained expression method that allow the analysis of butler versions with 100 philosophers and 201 tasks. In [33] experiments with the PAL system are reported for the basic version (which is similar to our first version) and for a version in which deadlock is avoided by alternating the order in which philosophers pick up their forks (which is somewhat similar to our second version) The analysis performed ....

W. J. Yeh. Controlling state explosion in reachability analysis. PhD Dissertation, Purdue University, West LaFayette, Indiana, December 1993.

....As a result, these LTSs may be excessively large 4 and contain many spurious traces. As such, the state explosion problem could be exacerbated. Contextual reachability analysis is a promising technique to alleviate the problem by including context constraints in compositional minimisation [1, 5, 16]. These constraints can be derived algorithmically [1] but may be too weak to adequately constrain the compositional analysis. Users may therefore wish to provide their own constraints based on their knowledge and intuition about the target system. This approach was studied by Graf [5] and Yeh ....

....16] These constraints can be derived algorithmically [1] but may be too weak to adequately constrain the compositional analysis. Users may therefore wish to provide their own constraints based on their knowledge and intuition about the target system. This approach was studied by Graf [5] and Yeh [16]. The technique of Graf allows users to specify context constraints as finite state interface processes which introduce undefinedness predicates wherever the processes inhibit some transitions. Since users may possess an imprecise knowledge of the system, interface processes given by users may be ....

[Article contains additional citation context not shown here]

W. J. Yeh, "Controlling State Explosion in Reachability Analysis," : SERC, Purdue University, December 1993.

....model, often called a reachability graph, is constructed from models of individual processes abstracted from the system being analysed, and contains all reachable states in the system. The reachability graph is then analysed for general properties like freedom from deadlocks and livelocks [14]. The use of a composition operator is indispensable in the construction of the composite state transition model of the system from models of its individual components. Reachability analysis can therefore be applied to models like Petri nets, CCS, or CSP [12, 11, 10] We will simplify our ....

....of P 2 , and so on. In the case where all combinations should be possible (worst case) system P would consist of s 1 Theta s 2 Theta Delta Delta Delta Theta s n states. Reachability analysis has therefore exponential complexity, which is often referred to as the state explosion problem [14, 2]. There exist two factors that may help to reduce the size of the problem: 1. arbitrary interleaving is pruned out by the need to synchronise actions common in the process alphabets; 2. by use of the hiding operator. Actions which are internal in subsystems or which the developer does not want ....

[Article contains additional citation context not shown here]

W.J. Yeh. Controlling State Explosion in Reachability Analysis. PhD thesis, Purdue University, 1993.

....by the environment on subsystem behaviour. 1.2 Related Work using Context Constraints The state explosion problem mentioned can be controlled if context constraints are incorporated in behaviour analysis. Different approaches of applying context constraints were proposed in the literature [12, 16, 26, 41]. Larsen [26] has presented a technique of using context constraints in parameterising behaviour bisimulation. The parameterised bisimulation is called relative bisimulation which can be used to reduce the computational efforts in verifying distributed systems. Clarke et al. 12] have proposed a ....

....predicates which are used to model undefined transitions. Constraints are checked to be improperly specified if there remains some undefined predicates in the global LTS. In such situation, the global LTS constructed does not faithfully represent the behaviour of the distributed systems. Yeh [41] has presented a variant technique to that of Graf and Steffen. The technique uses an extended computational model based on process algebra ACP [4] The extended model contains two special primitives start and stop. They are special actions specified by software developers on the top of process ....

[Article contains additional citation context not shown here]

W.J. Yeh. Controlling State Explosion in Reachability Analysis, Ph.D. dissertation, SERCTR -147-P, SERC, Purdue University, December 1993.

....automation and complements and mirrors the software architecture of the program design. 1.2 Related Work CRA techniques were originally proposed to remedy the problem of traditional reachability analysis techniques [2, 28, 33] which compose the global system representation in a single step. Yeh [36] described several case studies which suggested similar performance between a technique of compositional reachability analysis and that of constraint expressions [3] Sabnani [30] described an experiment applying compositional reachability analysis to the Q.931 protocol. They found that the ....

W. J. Yeh. Controlling State Explosion in Reachability Analysis, Technical Report, SERC-TR-147-P, SERC, Purdue University, December 1993.

....providing for undefined predicates which are used to model undefined transitions. Constraints are identified to be improperly specified if undefined predicates appear at the global LTS. The global LTS thus constructed does not faithfully represent the behaviour of the distributed system. Yeh [41] presented a variant technique to that of Graf and Steffen based on process algebra ACP [4] Yeh proposed a new approach to specify context constraints. Rather than specifying constraints as separate interface processes, they are inserted directly in the primitive processes by means of transitions ....

....to that used in conventional CRA. Undefined states are transparent to users because they are inserted automatically by the technique. Therefore, contextual CRA provides the users with essentially the same view of their designs as conventional CRA. As in the work of Graf and Steffen [18] and Yeh [41], our discussion focuses on the construction of composite LTSs; application of context constraints to preserve logical properties as suggested by Clarke et al. 13] is not addressed. The main theme of the paper is to present a simple and promising automated technique for the application of context ....

[Article contains additional citation context not shown here]

W. J. Yeh, "Controlling State Explosion in Reachability Analysis," Technical Report, SERC-TR-147-P, SERC, Purdue University, December 1993.

....reduction allows problems with more than 100 tasks to be analyzed. Our experimental results with such problems fare very well in comparison to the results reported for both the constrained expressions tool [8,16] and the PAL tool (which is based on using process algebra and compositional analysis) [15], which are the only other automated methods we know of that have been shown to be able to analyze an Ada program of more than 100 tasks. Early work on reduction of graph models expressing concurrency was reported by Gostelow et al. 25] Their reductions were based on a narrow set of ....

....for deadlock analysis in Ada tasking. We can make the following observations based on a comparison of our experiments with experiments reported for two other fully automated analysis tools that also avoid full state space generation the constrained expressions toolset [8,16] and the PAL tools [15]. Both of these approaches have been shown to be capable of handling the dining philosophers problem with more than 100 philosopher tasks. For the dining philosophers problem (without a butler task) a combination of net reduction followed by reduced state space generation is also capable of ....

[Article contains additional citation context not shown here]

W. J. Yeh, Controlling State Explosion in Reachability Analysis, PhD Dissertation, Dept. of Computer Science, Purdue University, Aug. 1993.

....category are known as compositional reachability analysis (or CRA for brevity) They are originally proposed to remedy the problem of traditional reachability analysis techniques [2, 18, 22] which compose the global system representation in a single step. Promising results have been reported. Yeh [24] reported several case studies which suggested similar performance between a technique of compositional reachability analysis and that of constraint expressions [3] Sahnani [19] reported an experiment applying compositional reachability analysis to the Q.931 protocol. They found that the ....

W. J. Yeh, "Controlling State Explosion in Reachability Analysis," : SERC, Purdue University, December 1993.

....in this category are known as compositional reachability analysis (CRA) They were originally proposed to remedy the problem of traditional reachability analysis techniques [19, 23] which compose the global system representation in a single step. Promising results have been reported. Yeh [26] described several case studies which suggested similar performance between a technique of compositional reachability analysis and that of constraint expressions [4] Sabnani et al. 21] described an experiment applying compositional reachability analysis to the Q.931 protocol. They found that the ....

W. J. Yeh, "Controlling State Explosion in Reachability Analysis," : SERC, Purdue University, December 1993.

No context found.

Yeh, W.J., 93a. "Controlling State Explosion in Reachability Analysis," SERC, Purdue University, PhD Thesis SERC-TR-147-P, December 1993.

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