Abstract
Compared with other verification methods, to some sense, model checking can be thought of as more attractive method to test hardware and software systems due to its automatic features. However, a stumbling problem is how to supply correct formal properties in logic to do model checking by system designers without specific mathematical background. This paper first presents two intuittive representations for the LTL formulas: one is graphical automaton-like; the other is textual regular-expression-like and then shows how these representations can be used to construct Büchi automata for LTL model checking.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
G. S. Avrunin, U. A. Buy, J. C. Corbett, L. K. Dillon, and J. C. Wileden. Automated Analysis of Concurrent Systems with the Constrained Expression Tool-set. IEEE Transactions on Software Engineering, 17(11): 1024–1222, Nov. 1991.
I. Beer, S. Ben-David, A. Landver. On-the-fly Model Checking of RCTL Formulas. CAV’98, LNCS 1427, pp. 184–194.
E. M. Clark, I. A. Draghicescu. Expressibility results for linear time and branching time logics. In Linear time, Branching time, and Partial order in Logics and Models for Concurrency, LNCS 354, pp. 428–437. Springer, 1988.
J. C. Corbett, M. B. Dwyer, J. Hatcliff, and Robby. A Language Framework for Expressing Checkable Properties of Dynamic Software. In SPIN Software Model Checking Workshop, pp. 205–223. Stanford, CA. 2000.
E. M. Clark, Jr., O. Grumberg, and D. A. Peled. Model Checking. MIT Press. 1999.
M. B. Dwyer, G. S. Avrunin and J. C. Corbett. Pat-terns in Property Specifications for Finite-State Verification. In Proc. of the 21st International Conf. on Software Engineering, pp. 411–420. May, 1999.
M. Daniele, F. Giunchiglia, and M. Vardi. Improved Automata Generation for Linear Temporal Logic. In Proc. of the 11th International Conference on Computer Aided Verification (CAV’99), Trento, Italy. Springer, LNCS 1631.
L. K. Dillon, G. Kutty, L. E. Moser, P. M. Melliar-Smith, and Y. S. Ramakrishna. A Graphical Interval Logic for Specifying Concurrent Systems. ACM Transactions on Software Engineering and Methodology, 3(2): 131–165, Apr. 1994.
C. Fritz. Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata. In CIAA 2003, LNCS 2759, pp. 35–48, 2003.
D. Giannakopoulou and F. Lerda. From States to Transitions: Improving Translation of LTL formulae to Büchi Automata. In Formal Techniques for Networked and Distributed Systems-FORTE 2002, LNCS 2529, pp. 308–326, Texas, USA, November, 2002.
P. Gastin and D. Oddoux. Fast LTL to Büchi Automata Translation. In Proc. of the 13th International Conference on Computer Aided Verification (CAV’01). July, 2001, Paris, France. Springer, LNCS 2102.
R. Gerth, D. Peled, M. Vardi and P. Wolper. Simple On-the-fly Automatic Verification of Linear Temporal Logic. In Proc. of the 15th IFIP/WG6.1 Symposium on Protocol Specification, Testing and Verification (PSTV’95). June, 1995, Warsaw, Poland.
R. Gerth, D. Peled, M. Vardi and P. Wolper. Simple On-the-fly Automatic Verification of Linear Temporal Logic. In Proc. of the 15th IFIP/WG6.1 Symposium on Protocol Specification, Testing and Verification (PSTV’95). June, 1995, Warsaw, Poland.
J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Language, and Computation (second edition). Addison-Wesley, 2001.
A. Pnueli. A temporal logic of concurrent programs. Theoretical Computer Science 13: 45–60.
F. Somenzi and R. Bloem. Efficient Büchi Automata from LTL Formulae. In Computer Aided Verification, 12th International Conference (CAV2000), LNCS 1855, pp. 249–263, 2000.
R. Schlör and W. Damm. Specification of system-level hardware designs using timing diagrams. In Proc. Europe Conf. Design Automation and Europe Event in ASIC Design, pages 518–524, Paris, Feb. 1993. IEEE Computer Society Press.
M.H. Smith, G. J. Holzmann and K. Etessami. Events and Constraints: A Graphical Editor for Capturing Logic Requirements of Programs. In the 5th IEEE International Symposium on Requirements Engineering, pp. 14–23. Canada, August, 2001.
X. Thirioux. Simple and Efficient Translation from LTL Formulas to Büchi Automata. In Electronic Notes in Theoretical Computer Science 66 No. 2(2002).
Y. Zhao. Intuitive Representations for Temporal Logic Formulas. In Proc. of Forum on Specification and Design Language (FDL’03), pp. 405–413, Frankfurt, Germany, September, 2003.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science + Business Media, Inc.
About this paper
Cite this paper
Zhao, Y. (2004). LTL’s Intuitive Representations and Its Automaton Translation. In: Kleinjohann, B., Gao, G.R., Kopetz, H., Kleinjohann, L., Rettberg, A. (eds) Design Methods and Applications for Distributed Embedded Systems. DIPES 2004. IFIP International Federation for Information Processing, vol 150. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8149-9_4
Download citation
DOI: https://doi.org/10.1007/1-4020-8149-9_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-8148-4
Online ISBN: 978-1-4020-8149-1
eBook Packages: Springer Book Archive