B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation-free mu-calculus. In Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN '02), volume 2318 of Lecture Notes in Computer Science. Springer-Verlag Inc., 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....automata theoretic approach presented in [8] It is based on a translation of RegCTL formula into hesitant weak symmetric alternating tree automaton. The model checking problem can be then reduced to checking nonemptiness of 1 letter simple weak alternating word automaton. Employing methods from [4] we attain a distributed local model checking algorithm (i.e, it computes the necessary part of a transition system on the fly) On the contrary to CTL, the size of the automaton corresponding to the formula can be exponential and therefore the model checking of RegCTL is in PSPACE. Nevertheless, ....

....[8] we have that RegCTL program complexity of model checking is NLOGSPACE complete too. 5 Distributed RegCTL Model Checking The distributed algorithm is based on a characterisation of the model checking problem in terms of two person games due to Stirling [10] This approach has been used in [4] for model checking of alternation free calculus and formulated as colouring of game graphs. As it is noted in [4] the procedure can also be understood as a parallel procedure for checking the emptiness of 1 letter simple weak alternating word automata. we have constructed in Section 3 is a ....

[Article contains additional citation context not shown here]

B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation-free mu-calculus. In Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN '02), volume 2318 of Lecture Notes in Computer Science. Springer-Verlag Inc., 2002.

.... speci ed (thus, properties are far from re usable) Other problems are of a more technical matter, such as dealing with transition systems of around one gigabyte, speeding up the generation of the transition system and the model checking (the latter for example by using a parallel model checker [12]) We have been able to verify a combination of four Erlang modules, together containing about 200 lines of advanced code, containing pattern matching, library functions, higher order functions, and several data structures (lists, records, etc. The CRL speci cations we obtained from this code ....

B. Bollig, M. Leucker, and M. Weber, Local Parallel Model Checking for the Alternation Free {Calculus. tech. rep. AIB-04-

....clients. The latter consisted of a model with a million states and it took a few hours to verify the mutual exclusion property. A recently developed parallel model checker has been used to check our largest transition system. The few hours have been reduced to nine minutes on about fty processors [5]; a promissing development for scaling this approach. 5.2 Starvation Proving that there is no starvation for the processes turned out to be a problem. This is caused by the fact that there are traces in the transition system that do not correspond to a fair run of the Erlang program. The Erlang ....

B. Bollig, M. Leucker, and M. Weber, Local Parallel Model Checking for the Alternation Free {Calculus. tech. rep. AIB-04-2001, RWTH Aachen, March 2001.

No context found.

B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation-free mu-calculus. In Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN '02), volume 2318 of Lecture Notes in Computer Science. Springer-Verlag Inc., 2002.

No context found.

B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation free --calculus. Technical Report AIB-04-2001, RWTH Aachen.

No context found.

B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation-free mu-calculus. In Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN '02), volume 2318 of Lecture Notes in Computer Science. Springer-Verlag Inc., 2002.

No context found.

B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation free --calculus. Technical Report AIB-04-2001, RWTH Aachen, Mar. 2001.

No context found.

B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation-free mu-calculus. In Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN '02), volume 2318 of Lecture Notes in Computer Science. Springer-Verlag Inc., 2002.

No context found.

B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation free --calculus. Technical Report AIB-04-2001, RWTH Aachen, Mar. 2001.

....the work was done during the author s employment at the RWTH Aachen. D. Bosnacki and S. Leue (Eds. SPIN 2002, LNCS 2318, pp. 128 147, 2002. c Springer Verlag Berlin Heidelberg 2002 underlying transition system. Several sequential model checking procedures are given in the literature (cf. [4] for an overview) The algorithms can be classified into global and local algorithms. The first require the underlying transition system to be completely constructed while local ones compute the necessary part of a transition system on the fly. In complexity theory, it is a well accepted view ....

....a parallel algorithm for a fragment of L . 12] introduced a symbolic parallel algorithm for the full calculus. However, both are global so that the transition system has to be constructed totally. 6] presents a model checking algorithm for LTL using a costly parallel cycle detection. Confer [4] for further related work. Our main contribution is the first local parallel model checking algorithm for L that supports interactive debugging and omits a cycle detection, which allows a powerful parallel realisation of it. In Section 2, we fix some notions on graphs, recall the syntax and ....

[Article contains additional citation context not shown here]

B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation free --calculus. Technical Report AIB-04-2001, RWTH Aachen, 03/2001.

....out that the algorithm scales very well wrt. run time and memory consumption when enlarging the NOW. Furthermore, the distribution of states on the processors is homogeneous. While the demand for parallel veri cation procedures also attracted several other researchers (on overview can be found in [1]) Parallel Truth is to our knowledge the rst parallel model checking tool that allows the validation of safety and liveness properties. A thorough presentation of this algorithm and its runtime properties can be found in [1] ....

....also attracted several other researchers (on overview can be found in [1] Parallel Truth is to our knowledge the rst parallel model checking tool that allows the validation of safety and liveness properties. A thorough presentation of this algorithm and its runtime properties can be found in [1]. ....

Benedikt Bollig, Martin Leucker, and Michael Weber. Local parallel model checking for the alternation free {calculus. Technical Report AIB-04-2001, RWTH Aachen, March 2001.

....is an important topic in the area of computer aided veri cation methods. Particular interest 6 is attracted by distributed approaches employing networks of workstations (NOWs) not only for reasons of reduced runtime requirements but mainly for ghting the state space explosion problem (see [5] for an overview) In [5] a distributed model checking algorithm for the alternation free fragment of the calculus is introduced (which is an improved version of the one presented in [6] To test whether the initial state satis es the desired property, it interleaves the computation of the ....

....in the area of computer aided veri cation methods. Particular interest 6 is attracted by distributed approaches employing networks of workstations (NOWs) not only for reasons of reduced runtime requirements but mainly for ghting the state space explosion problem (see [5] for an overview) In [5] a distributed model checking algorithm for the alternation free fragment of the calculus is introduced (which is an improved version of the one presented in [6] To test whether the initial state satis es the desired property, it interleaves the computation of the transition system with a ....

[Article contains additional citation context not shown here]

B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation free {calculus. Technical Report AIB{04-2001, Aachen University of Technology, 2001. Available at http://aib.informatik. rwth-aachen.de/2001/2001-04.ps.gz.

No context found.

B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation-free mu-calculus. In Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN '02). Springer-Verlag Inc., 2002.

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