Zusammenfassung
In diesem Kapitel betrachten wir noch eine weitere Logik, die sich einerseits von der Art ihrer Operatoren her wesentlich von MSO unterscheidet, sich andererseits jedoch in MSO—sogar in FO—einbetten lässt. Der Unterschied zu MSO besteht hauptsächlich darin, dass es keine direkten Quantoren über Positionen und Mengen von Positionen in einem Wort gibt. Stattdessen stellt man sich im Rahmen der Temporallogik ein Wort als einen zeitlichen Ablauf von Ereignissen, die durch die Alphabetsymbole kodiert sind, vor. Eine temporallogische Formel wird dann immer in einer einzigen Position des Wortes interpretiert. Diese stellt sozusagen den jetzigen Zeitpunkt dar, während das Suffix des Wortes an dieser Position die Zukunft repräsentiert. Die Operatoren der temporalen Logik machen dann Aussagen über Ereignisse in der Zukunft. Hier beschränken wir uns auf eine der einfachsten Temporallogiken, das sogenannte LTL.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literaturverzeichnis
Y. Gurevich and L. Harrington. Trees, automata, and games. In Proc. 14th Annual ACM Symp. on Theory of Computing, STOC’82, pages 60– 65. ACM, 1982.
S. Safra. On the complexity of !-automata. In Proc. 29th Symp. on Foundations of Computer Science, FOCS’88, pages 319–327. IEEE, 1988.
F. P. Ramsey. On a problem in formal logic. Proc. London Math. Soc. (3), 30:264–286, 1930.
M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1–37, 1994.
C. S. Lee, Neil D. Jones, and A. M. Ben-Amram. The size-change principle for program termination. In Proc. 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL’01, pages 81–92. ACM, 2001.
C. Löding and W. Thomas. Alternating automata and logics over infinite words. In Proc. IFIP Int. Conf. on Theoretical Computer Science, TCS’00, volume 1872 of LNCS, pages 521–535. Springer, 2000.
V. Diekert and P. Gastin. First-order definable languages. In J. Flum, E. Grädel, and T. Wilke, editors, Logic and Automata: History and Perspectives, Texts in Logic and Games, pages 261–306. Amsterdam University Press, 2008.
O. Kupferman and M. Y. Vardi. Weak alternating automata and tree automata emptiness. In Proc. 30th Annual ACM Symp. on Theory of Computing, STOC’98, pages 224–233. ACM Press, 1998.
D. E. Muller and P. E. Schupp. Alternating automata on infinite trees. TCS, 54(2-3):267–276, 1987.
C. Dax, M. Hofmann, and M. Lange. A proof system for the linear time μ-calculus. In Proc. 26th Conf. on Foundations of Software Technology and Theoretical Computer Science, FSTTCS’06, volume 4337 of LNCS, pages 274–285. Springer, 2006.
E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.
B. Knaster. Un théorèm sur les fonctions d’ensembles. Annals Soc. Pol. Math, 6:133–134, 1928.
D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. The temporal analysis of fairness. In Proc. 7th Symp. on Principles of Programming Languages, POPL’80, pages 163–173. ACM, 1980.
D. E. Muller. Infinite sequences and finite machines. In Proc. 4th Ann. Symp. on Switching Circuit Theory and Logical Design, pages 3–16. IEEE, 1963.
J. Flum, E. Grädel, and T. Wilke, editors. Logic and Automata: History and Perspectives, volume 2 of Texts in Logic and Games. Amsterdam University Press, 2007.
D. König. Über eine Schlussweise aus dem Endlichen ins Unendliche. Acta litterarum ac scientiarum Regiae universitatis Hungaricae Francisco- Josephinae. Sectio: Acta scientiarum mathematicarum, 3:121–130, 1927.
A. P. Sistla, M. Y. Vardi, and P.Wolper. Reasoning about infinite computation paths. In Proc. 24th Symp. on Foundations of Computer Science, FOCS’83, pages 185–194, Los Alamitos, Ca., USA, 1983. IEEE.
G. Winskel. The Formal Semantics of Programming Languages: An Introduction. MIT Press, 1993.
H. W. Kamp. On tense logic and the theory of order. PhD thesis, Univ. of California, 1968.
R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9(5):521–530, 1966.
D. Gabbay. The declarative past and imperative future: Executable temporal logic for interactive systems. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Proc. Conf. on Temporal Logic in Specification, volume 398 of LNCS, pages 409–448. Springer, 1989.
W. Thomas. Star-free regular sets of !-sequences. Information and Control, 42(2):148–156, 1979.
F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In Proc. 12th Int. Conf. on Computer Aided Verification, CAV’00, volume 1855 of LNCS, pages 248–263. Springer, 2000.
A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114–133, 1981.
C. Baier and J.-P. Katoen. Principles of Model Checking. The MIT Press, 2008.
A. W. Mostowski. Regular expressions for infinite trees and a standard form of automata. In Proc. 5th Symp. on Computation Theory, volume 208 of LNCS, pages 157–168. Springer, 1984.
D. Giannakopoulou and F. Lerda. From states to transitions: Improving translation of LTL formulae to Büchi automata. In Proc. 22nd Int. Conf. on Formal Techniques for Networked and Distributed Systems, FORTE’02, volume 2529 of LNCS, pages 308–326. Springer, 2002.
S. Miyano and T. Hayashi. Alternating finite automata on omega-words. TCS, 32(3):321–330, 1984.
B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 2 edition, 2002.
R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Computing, 1:146–160, 1972.
A. P. Sistla, M. Y. Vardi, and P. Wolper. The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science, 49(2–3):217–237, 1987.
R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677–691, 1986.
W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 4, pages 133–191. Elsevier Science Publishers B. V., 1990.
Shmuel Safra. Complexity of automata on infinite objects. PhD thesis, Weizmann Institute of Science, Rehovot, Israel, 1989.
D. E. Muller, A. Saoudi, and P. E. Schupp. Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time. In Proc. 3rd Symp. on Logic in Computer Science, LICS’88, pages 422–427, Edinburgh, Scotland, 1988. IEEE.
S. Fogarty and M. Y. Vardi. Efficient Büchi universality checking. In Proc. 16th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, TACAS’10, volume 6015 of LNCS, pages 205–220, 2010.
M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
S. Juvekar and N. Piterman. Minimizing generalized Büchi automata. In Proc. 18th Int. Conf. on Computer Aided Verification, CAV’06, volume 4144 of LNCS, pages 45–58. Springer, 2006.
P. Gastin and D. Oddoux. Fast LTL to Büchi automata translation. In Proc. 13th Int. Conf. on Computer Aided Verification, CAV’01, volume 2102 of LNCS, pages 53–65. Springer, 2001.
D. Kähler and Th. Wilke. Complementation, disambiguation, and determinization of Büchi automata unified. In Proc. 35th Int. Coll. on Automata, Languages and Programming, ICALP’08, volume 5125 of LNCS, pages 724–735. Springer, 2008.
W. Thomas. A combinatorial approach to the theory of !-automata. Information and Control, 48:261–283, 1981.
S. Schewe. Tighter bounds for the determinisation of Büchi automata. In Proc. 12th Int. Conf. on Foundations of Software Science and Computation Structures, FOSSACS’09, volume 5504 of LNCS, pages 167–181. Springer, 2009.
O. Kupferman and M. Y. Vardi. Safraless decision procedures. In Proc. 46th Ann. IEEE Symp. on Foundations of Computer Science, FOCS’05, pages 531–542. IEEE, 2005.
W. Thomas. Languages, automata and logic. In A. Salomaa and G. Rozenberg, editors, Handbook of Formal Languages, volume 3, Beyond Words. Springer, Berlin, 1997.
A. Tarski. A lattice-theoretical fixpoint theorem and its application. Pacific Journal of Mathematics, 5:285–309, 1955.
E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research, volume 2500 of LNCS. Springer, 2002.
N. Piterman. From nondeterministic Büchi and Streett automata to deterministic parity automata. In Proc. 21st Symp. on Logic in Computer Science, LICS’06, pages 255–264. IEEE Computer Society, 2006.
H. Karmarkar and S. Chakraborty. On minimal odd rankings for Büchi complementation. In Proc. 7th Int. Symp. on Automated Technology for Verification and Analysis, ATVA’09, volume 5799 of LNCS, pages 228– 243. Springer, 2009.
J. R. Büchi. On a decision method in restricted second order arithmetic. In Proc. Congress on Logic, Method, and Philosophy of Science, pages 1–12, Stanford, CA, USA, 1962. Stanford University Press.
N. Klarlund. Progress measures for complementation of !-automata with applications to temporal logic. In Proc. 32nd Annual Symp. on Foundations of Computer Science, FOCS’91, pages 358–367. IEEE, 1991.
O. Kupferman and M. Y. Vardi. Weak alternating automata are not that weak. ACM Transactions on Computational Logic, 2(3):408–429, 2001.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hofmann, M., Lange, M. (2011). Linearzeit-Temporale Logik. In: Automatentheorie und Logik. eXamen.press. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18090-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-18090-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18089-7
Online ISBN: 978-3-642-18090-3
eBook Packages: Computer Science and Engineering (German Language)