J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. In Proceedings of ICALP'2000, number 1853 in LNCS, pages 475-486. Springer-Verlag, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of di erent models used in the experiment was small, more experiments are needed to con rm our results. There are also model checking algorithms where checking B uchi acceptance is more complex than simple reachability. One example is the LTL X model checker for net unfoldings presented in [17]. Using a special algorithm for the safety subset has been proposed as a much simpler alternative [27] The results presented for CPN abstractions in this work makes incremental development more feasible. Because many safety properties can be veri ed on the abstract designs, correctness of the ....

Javier Esparza and Keijo Heljanko. A new unfolding approach to LTL model checking. In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000.

....Due to the variable concept in Promela it should be fairly easy Fig. 2. Result of SPIN and counter example to add this functionality, though the global clockmay impose a severe impact on efficiency of the validation. The PEP tool is currently extended bysomeadditional LTL model checkers from [8] and [12] This will give an opportunity to compare the different approaches and choose the algorithms best suiting the particular problem. ....

J. Esparza and K. Heljanko. A new unfolding approachtoLTL model checking. In Proc. ICALP 2000, LNCS 1853, Springer 2000

No context found.

J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. Research Report A60, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000. Available at <http://www.tcs.hut.fi/Publications/reports/A60abstract.html>.

No context found.

J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000.

No context found.

J. Esparza and K. Heljanko. A new Unfolding Approach to LTL Model Checking. In ICALP'00, LNCS 1853, pages 475 -- 486. Springer-Verlag, 2000.

No context found.

J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000), pages 475--486, July 2000. LNCS 1853.

No context found.

Javier Esparza and Keijo Heljanko. A new unfolding approach to LTL model checking. Research Report A60, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000. Available at http://www.tcs.hut.fi/pub/reports/A60.ps.gz.

No context found.

J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000), July 2000. Accepted for publication.

....200 212, Springer Verlag. The current author is the only author of publications [P1] P2] and [P5] by J. Esparza. The key ideas of the publication [P3] were jointly developed while the current author was visiting Technische Universitt Mnchen. Some key proof ideas on the tableaux side of [20] are due to J. Esparza, whereas the proofs of the used synchronization construction are by current author. The publication [P4] as well as the extended version [22] is co authored by J. Esparza. The paper was jointly written, with the current author designing the presented algorithms, ....

....checking procedure for an action based linear temporal logic is presented. This procedure solves the model checking problem by direct inspection of a prefix instead of requiring the running of an elaborate algorithm on the prefix, as is the case in previous approaches [75] The report version [20] is an extended version that contains proofs and examples not contained in the conference version [P3] due to length constraints. P4] An implementation of a net unfolding based linear temporal logic model checker is presented. The tableau procedure of [P3] is applied to a state based ....

[Article contains additional citation context not shown here]

J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. Research Report A60, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000.

....i . with C # e is a configuration of BP i . Replace Because i is a branching process . with Because BP i is a branching process . On page 37 of [P4] Section 1 Introduction, line 8 in the section: A new algorithm with better complexity bounds was introduced in [19], in the shape of a tableau system. should be A new algorithm with smaller memory requirements in several interesting model checking instances was introduced in [19] in the shape of a tableau system. On page 41 of [P4] Theorem 1, footnote: Here we shortly describe the problem behind ....

....page 37 of [P4] Section 1 Introduction, line 8 in the section: A new algorithm with better complexity bounds was introduced in [19] in the shape of a tableau system. should be A new algorithm with smaller memory requirements in several interesting model checking instances was introduced in [19], in the shape of a tableau system. On page 41 of [P4] Theorem 1, footnote: Here we shortly describe the problem behind the technical restriction. The technical requirement of incomparable markings comes from the fact that in the algorithm and proofs the L events should not be concurrent ....

J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000.

....programming techniques which are based on well known Petri net techniques like invariants and implicit places, and (2) local net reductions. We show that the conditions for the application of some local net reductions can be weakened if one is interested in LTL model checking using the approach of [EH00,EH01]. Finally, we present a number of experimental results and show that the model checking time of a net system can be significantly decreased if it has been preprocessed with our reduction techniques. 1 Introduction In two recent papers [EH00,EH01] Esparza and Heljanko have developed an unfolding ....

....in LTL model checking using the approach of [EH00,EH01] Finally, we present a number of experimental results and show that the model checking time of a net system can be significantly decreased if it has been preprocessed with our reduction techniques. 1 Introduction In two recent papers [EH00,EH01], Esparza and Heljanko have developed an unfolding technique to the problem of model checking LTL for concurrent systems. Using the automata theoretic approach, the model checking problem is reduced to two simpler problems concerning the infinite executions of a combined system obtained from the ....

[Article contains additional citation context not shown here]

J. Esparza and K. Heljanko. A new Unfolding Approach to LTL Model Checking. In ICALP'00, LNCS 1853, pages 475 -- 486. Springer-Verlag, 2000.

....in terms of a BDD, thus providing a very good solution to the state explosion problem. Unfolding based model checking techniques for LTL without the next operator (called LTL X in the sequel) were rst proposed in [22] A new algorithm with better complexity bounds was introduced in [3], in the shape of a tableau system. The approach is based on the automata theoretic approach to model checking (see for instance [20] consisting of the following well known three steps: 1) translate the negation of the formula to be checked into a Bchi automaton; 2) synchronize the system and ....

....(1) translate the negation of the formula to be checked into a Bchi automaton; 2) synchronize the system and the Bchi automaton in an adequate way to yield a composed system, and (3) check emptiness of the language of the composed system, where language is again de ned in a suitable way. In [3] we used an action based version of LTL X having an operator # 1 U a # 2 for each action a; # 1 U a # 2 holds if # 1 holds until action a occurs, and immediately after # 2 holds. Step (2) is very simple for this logic, which allowed us to concentrate on step (3) the most novel contribution ....

[Article contains additional citation context not shown here]

J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000), pages 475486, July 2000. LNCS 1853.

No context found.

J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. Research Report A60, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000. Available at <http://www.tcs.hut.fi/Publications/reports/A60abstract.html>.

....in terms of a BDD, thus providing a very good solution to the state explosion problem. Unfolding based model checking techniques for LTL without the next operator (called LTL X in the sequel) were first proposed in [22] A new algorithm with better complexity bounds was introduced in [3], in the shape of a tableau system. The approach is based on the automata theoretic approach to model checking (see for instance [20] consisting of the following wellknown three steps: 1) translate the negation of the formula to be checked into a Bchi automaton; 2) synchronize the system and ....

....(1) translate the negation of the formula to be checked into a Bchi automaton; 2) synchronize the system and the Bchi automaton in an adequate way to yield a composed system, and (3) check emptiness of the language of the composed system, where language is again defined in a suitable way. In [3] we used an action based version of LTL X having an operator # 1 U a # 2 for each action a; # 1 U a # 2 holds if # 1 holds until action a occurs, and immediately after # 2 holds. Step (2) is very simple for this logic, which allowed us to concentrate on step (3) the most novel contribution ....

[Article contains additional citation context not shown here]

J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000), pages 475--486, July 2000. LNCS 1853.

....checker to take both the net system, and the LTL( X) formula as input to the pre x generation process. In this approach also the semantic pre x completeness criterion is parameterized by the checked formula, and the model checking can be done in polynomial time in the size of this product pre x [7]. The price to pay is a larger pre x. A simpler product method works with safety model checking. Acknowledgements Part of this work was done during a visit to Prof. J. Esparza s research group at TU Mnchen. The author would like to thank for the visit opportunity, and for discussions about the ....

J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000), July 2000. Accepted for publication.

....Petri net or as a product of automata 1 . Notice that this is an upper bound: the new pre x is usually much smaller than the state space, and in particular for Niebert s example it grows linearly in n. The paper is structured as follows (for detailed de nitions and proofs see the full version [5]) Section 2 presents the automata theoretic approach to LTL model checking. In Sect. 3 the unfolding method is introduced. Sections 4 and 5 contain the tableau systems for the two subproblems. In Sect. 6 we show how LTL model checking can be solved with the presented tableau systems. In Sect. 7 ....

....attacks this problem as follows. First, a procedure similar to that of [6] converts the negation of into a B uchi automaton A: over the alphabet = V [f g, where 62 A is a new label used to represent all the invisible actions. Then, this automaton is synchronized with on visible actions (see [5] for details) The synchronization can be represented by a new labelled net system : containing a transition (u; t) for every u = q a q 0 in A: and for every t 2 T , such that l(t) a and a 2 V , plus other transitions for the invisible transitions of . We say that (u; t) is an in ....

[Article contains additional citation context not shown here]

Javier Esparza and Keijo Heljanko. A new unfolding approach to LTL model checking. Research Report A60, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000. Available at http://www.tcs.hut.fi/pub/reports/A60.ps.gz.

No context found.

J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. In Proceedings of ICALP'2000, number 1853 in LNCS, pages 475-486. Springer-Verlag, 2000.

No context found.

Esparza, J., Heljanko, K.: A new unfolding approach to LTL model checking. Technical Report HUT-TCS-A60, Helsinki University of Technology (2000) Available from http://www.tcs.hut.fi/Publications.

No context found.

Esparza, J., and Heljanko, K.: A new unfolding approach to LTL model checking. In Proc. ICALP 2000. Volume 1853 of LNCS. Springer-Verlag (2000) 475-486

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