Results 11 to 20 of about 93,973 (331)
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
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
, 2017 Since the early 1990's, classical temporal logics have been extended with timing constraints. While temporal logics only express contraints on the order of events, their timed extensions can add quantitative constraints on delays between those events. We survey expressive-ness and algorithmic results on those logics, and discuss semantic choices that ...
Bouyer, Patricia +4 more
openaire +2 more sources
Моделирование и анализ информационных систем, 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
On the Modeling and Verification of Collective and Cooperative Systems
Frontiers in Robotics and AI, 2022 The formal description and verification of networks of cooperative and interacting agents is made difficult by the interplay of several different behavioral patterns, models of communication, scalability issues.
Alessandro Aldini
doaj +1 more source
Logical Methods in Computer Science, 2013 This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations of Boolean and
François Laroussinie +2 more
doaj +1 more source
A Formal Approach to Coercion Resistance and Its Application to E-Voting
Mathematics, 2022 The outbreak of the COVID-19 pandemic brought renewed attention to electronic voting—this time as a potential option to contain the spread during elections.
Stanislas Riou +2 more
doaj +1 more source