Model Checking. Part III

Kazuhisa Ishida; Yasunari Shidama

Formalized Mathematics (2008)

  • Volume: 16, Issue: 4, page 339-353
  • ISSN: 1426-2630

Abstract

top
This text includes verification of the basic algorithm in Simple On-the-fly Automatic Verification of Linear Temporal Logic (LTL). LTL formula can be transformed to Buchi automaton, and this transforming algorithm is mainly used at Simple On-the-fly Automatic Verification. In this article, we verified the transforming algorithm itself. At first, we prepared some definitions and operations for transforming. And then, we defined the Buchi automaton and verified the transforming algorithm.MML identifier: MODELC 3, version: 7.9.03 4.108.1028

How to cite

top

Kazuhisa Ishida, and Yasunari Shidama. "Model Checking. Part III." Formalized Mathematics 16.4 (2008): 339-353. <http://eudml.org/doc/266731>.

@article{KazuhisaIshida2008,
abstract = {This text includes verification of the basic algorithm in Simple On-the-fly Automatic Verification of Linear Temporal Logic (LTL). LTL formula can be transformed to Buchi automaton, and this transforming algorithm is mainly used at Simple On-the-fly Automatic Verification. In this article, we verified the transforming algorithm itself. At first, we prepared some definitions and operations for transforming. And then, we defined the Buchi automaton and verified the transforming algorithm.MML identifier: MODELC 3, version: 7.9.03 4.108.1028},
author = {Kazuhisa Ishida, Yasunari Shidama},
journal = {Formalized Mathematics},
language = {eng},
number = {4},
pages = {339-353},
title = {Model Checking. Part III},
url = {http://eudml.org/doc/266731},
volume = {16},
year = {2008},
}

TY - JOUR
AU - Kazuhisa Ishida
AU - Yasunari Shidama
TI - Model Checking. Part III
JO - Formalized Mathematics
PY - 2008
VL - 16
IS - 4
SP - 339
EP - 353
AB - This text includes verification of the basic algorithm in Simple On-the-fly Automatic Verification of Linear Temporal Logic (LTL). LTL formula can be transformed to Buchi automaton, and this transforming algorithm is mainly used at Simple On-the-fly Automatic Verification. In this article, we verified the transforming algorithm itself. At first, we prepared some definitions and operations for transforming. And then, we defined the Buchi automaton and verified the transforming algorithm.MML identifier: MODELC 3, version: 7.9.03 4.108.1028
LA - eng
UR - http://eudml.org/doc/266731
ER -

References

top
  1. [1] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990. Zbl06213858
  2. [2] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990. 
  3. [3] Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990. 
  4. [4] Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990. 
  5. [5] Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990. 
  6. [6] Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990. 
  7. [7] Krzysztof Hryniewiecki. Basic properties of real numbers. Formalized Mathematics, 1(1):35-40, 1990. 
  8. [8] Kazuhisa Ishida. Model checking. Part I. Formalized Mathematics, 14(4):171-186, 2006. 
  9. [9] Kazuhisa Ishida. Model checking. Part II. Formalized Mathematics, 16(3):231-245, 2008. 
  10. [10] Jarosław Kotowicz. Real sequences and basic operations on them. Formalized Mathematics, 1(2):269-272, 1990. 
  11. [11] Konrad Raczkowski and Andrzej Nedzusiak. Series. Formalized Mathematics, 2(4):449-452, 1991. 
  12. [12] Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990. 
  13. [13] Wojciech A. Trybulec. Partially ordered sets. Formalized Mathematics, 1(2):313-319, 1990. 
  14. [14] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990. 
  15. [15] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990. 
  16. [16] Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.