Results 11 to 20 of about 71,357 (311)
The Logic of Temporal Domination [PDF]
2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF), 2019 In this short note, we are concerned with the fairness condition "A and B hold almost equally often", which is important for specifying and verifying the correctness of non-terminating processes and protocols. We introduce the logic of temporal domination, in which the above condition can be expressed.
Studer, Thomas, Thomas Studer
openaire +3 more sources
Substructure Temporal Logic [PDF]
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013 In formal verification and design, reasoning about substructures is a crucial aspect for several fundamental problems, whose solution often requires to select a portion of the model of interest on which to verify a specific property. In this paper, we present a new branching-time temporal logic, called Substructure Temporal Logic (STL, for short ...
BENERECETTI, MASSIMO +2 more
openaire +3 more sources
Expressiveness of Metric modalities for continuous time [PDF]
Logical Methods in Computer Science, 2007 We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by the previous modalities, over the real line, or over the positive reals.
Yoram Hirshfeld, Alexander Rabinovich
doaj +1 more source
MSI-A: An Energy Efficient Approximated Cache Coherence Protocol
IEEE Access, 2023 Energy consumption has become an essential factor in designing modern computer system architecture. Because of physical limits, the termination of Moore’s law and Dennard’s scaling has forced the computer design community to investigate new
Anant Saraswat +3 more
doaj +1 more source
Quickening Data-Aware Conformance Checking through Temporal Algebras
Information, 2023 A temporal model describes processes as a sequence of observable events characterised by distinguishable actions in time. Conformance checking allows these models to determine whether any sequence of temporally ordered and fully-observable events ...
Giacomo Bergami +2 more
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
PITL2MONA: Implementing a Decision Procedure for Propositional Interval Temporal Logic [PDF]
, 2004 Interval Temporal Logic (ITL) is a finite-time linear temporal logic with applications in hardware verification, temporal logic programming and specification of multimedia documents.
Howard Bowman +3 more
core +1 more source
Automata Linear Dynamic Logic on Finite Traces [PDF]
Logical Methods in Computer ScienceTemporal logics are widely used by the Formal Methods and AI communities. Linear Temporal Logic is a popular temporal logic and is valued for its ease of use as well as its balance between expressiveness and complexity.
Kevin W. Smith, Moshe Y. Vardi
doaj +1 more source
Optimal Control of Colored Timed Petri Nets Under Generalized Mutual Exclusion Temporal Constraints
IEEE Access, 2022 A coloured Petri net (CPN) is widely used to model discrete event systems due to its compact representation of the system by colour sets associated with places, transitions and I/O arcs.
Kohei Fujita, Toshimitsu Ushio
doaj +1 more source
Program transformations using temporal logic side conditions [PDF]
, 2009 This paper describes an approach to program optimisation based on transformations, where temporal logic is used to specify side conditions, and strategies are created which expand the repertoire of transformations and provide a suitable level of ...
Richard Warburton +7 more
core +1 more source