dc.contributor.author | Abuin Yepes, Alex | |
dc.contributor.author | Bolotov, Alexander | |
dc.contributor.author | Hermo Huguet, Montserrat | |
dc.contributor.author | Lucio Carrasco, Francisca | |
dc.date.accessioned | 2024-01-30T16:40:15Z | |
dc.date.available | 2024-01-30T16:40:15Z | |
dc.date.issued | 2020-09-25 | |
dc.identifier.citation | 27th International Symposium on Temporal Representation and Reasoning. LIPIcs (178) : (2020) | es_ES |
dc.identifier.uri | http://hdl.handle.net/10810/64468 | |
dc.description.abstract | When building tableau for temporal logic formulae, applying a two-pass construction, we first check the validity of the given tableaux input by creating a tableau graph, and then, in the second “pass”, we check if all the eventualities are satisfied. In one-pass tableaux checking the validity of the input does not require these auxiliary constructions. This paper continues the development of one-pass tableau method for temporal logics introducing tree-style one-pass tableau systems for Computation Tree Logic (CTL) and shows how this can be extended to capture Extended CTL (ECTL). A distinctive feature here is the utilisation, for the core tableau construction, of the concept of a context of an eventuality which forces its earliest fulfilment. Relevant algorithms for obtaining a systematic tableau for these branching-time logics are also defined. We prove the soundness and completeness of the method. With these developments of a tree-shaped one-pass tableau for CTL and ECTL, we have formalisms which are well suited for the automation and are amenable for the
implementation, and for the formulation of dual sequent calculi. This brings us one step closer to the application of one-pass context-based tableaux in certified model checking for a variety of CTL-type branching-time logics. | es_ES |
dc.description.sponsorship | Authors have been supported by the European Union (FEDER funds) under grant TIN2017-86727-C2-2-R, and by the University of the Basque Country under Project LoRea GIU18-182. | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik | es_ES |
dc.rights | info:eu-repo/semantics/openAccess | es_ES |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/deed.en | * |
dc.subject | temporal logic | es_ES |
dc.subject | fairness | es_ES |
dc.subject | expressiveness | es_ES |
dc.subject | branching-time | es_ES |
dc.title | One-Pass Context-Based Tableaux Systems for CTL and ECTL | es_ES |
dc.type | info:eu-repo/semantics/lecture | es_ES |
dc.rights.holder | © Alex Abuin, Alexander Bolotov, Montserrat Hermo, and Paqui Lucio;
licensed under Creative Commons License CC-BY | es_ES |
dc.relation.publisherversion | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.14 | |
dc.identifier.doi | 10.4230/LIPIcs.TIME.2020.14 | |
dc.departamentoes | Lenguajes y sistemas informáticos | es_ES |
dc.departamentoeu | Hizkuntza eta sistema informatikoak | es_ES |