Results 1 to 10 of about 3,248 (120)
Timed Context-Free Temporal Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and context-free ...
Laura Bozzelli +2 more
doaj +1 more source
Deterministic Temporal Logics and Interval Constraints [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 In temporal logics, a central question is about the choice of modalities and their relative expressive power, in comparison to the complexity of decision problems such as satisfiability.
Kamal Lodaya, Paritosh K. Pandya
doaj +1 more source
A Formal Methods Approach for Release Evaluation
Acta Infologica, 2021 In this paper, a formal method-based release evaluation method was developed. During the release evaluation process, two versions of a server are run under similar (or the same) configurations and the system logs are compared.
Ebru Aydın Göl
doaj +1 more source
Satisfiability Games for Branching-Time Logics [PDF]
Logical Methods in Computer Science, 2013 The satisfiability problem for branching-time temporal logics like CTL*, CTL and CTL+ has important applications in program specification and verification. Their computational complexities are known: CTL* and CTL+ are complete for doubly exponential time,
Oliver Friedmann +2 more
doaj +1 more source
First-Order and Temporal Logics for Nested Words [PDF]
Logical Methods in Computer Science, 2008 Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure of parse trees and other tree-structured data, such as XML.
Rajeev Alur +5 more
doaj +1 more source
The Logic of Khārijī Propositions [PDF]
حکمت سینوی, 2023 There are two general methods for interpreting and analyzing khārijī and ḥaqīqī propositions: first, by analyzing them within a unified logic; second, by assigning separate logics to khārijī and ḥaqīqī propositions.
Asadollah Fallahi
doaj +1 more source
On the Model Checking Problem for Some Extension of CTL*
Моделирование и анализ информационных систем, 2020 Sequential reactive systems include programs and devices that work with two streams of data and convert input streams of data into output streams. Such information processing systems include controllers, device drivers, computer interpreters.
Anton Romanovich Gnatenko +1 more
doaj +1 more source
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard? [PDF]
Logical Methods in Computer Science, 2022 Adding propositional quantification to the modal logics K, T or S4 is known to lead to undecidability but CTL with propositional quantification under the tree semantics (tQCTL) admits a non-elementary Tower-complete satisfiability problem. We investigate
Bartosz Bednarczyk, Stéphane Demri
doaj +1 more source
Wreath Products of Forest Algebras, with Applications to Tree Logics [PDF]
Logical Methods in Computer Science, 2012 We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics.
Mikolaj Bojanczyk +2 more
doaj +1 more source
Моделирование и анализ информационных систем, 2021 Sequential reactive systems are computer programs or hardware devices which process the flows of input data or control signals and output the streams of instructions or responses.
Anton Romanovich Gnatenko +1 more
doaj +1 more source