![]() In: Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), pp. Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal logic with forgettable past. (ed.) Computer Aided Verification, CAV 1993. Kesten, Y., Manna, Z., McGuire, H., Pnueli, A.: A decision algorithm for full propositional temporal logic. Jonsson, B., Tsay, Y.K.: Assumption/guarantee specifications in linear-time temporal logic. Grädel, E., Thomas, W., Wilke, T.: Automata Logics, and Infinite Games. (eds.) Formal Techniques for Networked and Distributed Sytems - FORTE 2002, FORTE 2002. Giannakopoulou, D., Lerda, F.: From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata. In: Protocol Specification, Testing and Verification XV, PSTV 1995. Gerth, R., Peled, D., Vardi, M.Y., Wolper, P.: Simple on-the-fly automatic verification of linear temporal logic. (eds.) Mathematical Foundations of Computer Science 2003, MFCS 2003. Gastin, P., Oddoux, D.: LTL with past and two-way very-weak alternating automata. (eds.) Computer Aided Verification, CAV 2001. Gastin, P., Oddoux, Denis: Fast LTL to Büchi automata translation. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2005. įritz, C.: Concepts of automata construction from LTL. (eds.) Implementation and Application of Automata, CIAA 2003. įritz, C.: Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata. (ed.) CONCUR 2000 - Concurrency Theory, CONCUR 2000. Įtessami, K., Holzmann, G.J.: Optimizing Büchi automata. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2008. ĭe Wulf, M., Doyen, L., Maquet, N., Raskin, J.-F.: Antichains: alternative algorithms for LTL satisfiability and model-checking. (eds.) Computer Aided Verification, CAV 1999. ĭaniele, M., Giunchiglia, F., Vardi, M.Y.: Improved automata generation for linear temporal logic. Ĭouvreur, J.-M.: On-the-fly verification of linear temporal logic. The MIT Press, Cambridge (2018)Ĭourcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory-efficient algorithms for the verification of temporal properties. SpringerĬlarke, E.M., Grumberg, O., Kroening, D., Peled, D.A., Veith, H.: Model Checking. , The doi refers to republication of the paper. In: Proceedings of the 1960 International Congress on Logic, Methodology and Philosophy of Science, pp. īüchi, J.R.: On a decision method in restricted second-order arithmetic. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2003. Keywordsīenedetti, M., Cimatti, A.: Bounded model checking for past LTL. Finally, we discuss the role of minimization in such an approach to translation of temporal formulae. The relevant notion of a very weak automaton is introduced with two equivalent defining conditions, each offering its unique advantage in a suitable context. ![]() In particular, we have tried wherever possible to avoid using types of automata or notations that are less common. They are adaptations of existing works, with a substantially different exposition, further improving simplicity for understanding and easiness for proofs. In this paper, we give a tutorial presentation of two translation algorithms adhering to the early and simple principle, one for formulae with only future operators and the other for formulae with both future and past operators. When it comes to translating temporal formulae with past operators, algorithms following the principle generalize more easily by using a two-way alternating automaton as the first intermediary. Among them, translations via alternating automata apparently better adhere to the aforementioned “early and simple” principle. They all go through one or more types of automata as intermediaries, with various interspersing formula manipulation and automaton generation along the way. Indeed, for linear-time temporal logic model checking, there are quite a few ways for translating a temporal formula into an equivalent Büchi automaton. This makes the entire reduction simpler for intuitive understanding and easier for correctness proofs. When there are multiple paths for the reduction, leaving the realm of application and entering that of automata as early as possible should be preferred, to take full advantages of the abundant algorithmic techniques from the latter. The automata-theoretic approach advocates reducing problems in an application domain to those in automata theory. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |