Results 31 to 40 of about 2,243,371 (296)
Expressiveness of Metric modalities for continuous time [PDF]
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
Temporal Logics with Language Parameters [PDF]
Computation Tree Logic (CTL) and its extensions CTL* and CTL+ are widely used in automated verification as a basis for common model checking tools. But while they can express many properties of interest like reachability, even simple regular properties like "Every other index is labelled a cannot be expressed in these logics. While many extensions were
Jens Oliver Gutsfeld +2 more
openaire +4 more sources
A Temporal Logic for Hyperproperties
Hyperproperties, as introduced by Clarkson and Schneider, characterize the correctness of a computer program as a condition on its set of computation paths. Standard temporal logics can only refer to a single path at a time, and therefore cannot express many hyperproperties of interest, including noninterference and other important properties in ...
Bernd Finkbeiner +2 more
openaire +3 more sources
Temporal Logics of Agency [PDF]
Time is the grand stage where human activities take place (rational or otherwise). And the view of a branching temporal universe, or tree of possible events, with our actual history linearly advancing through it, is a widely shared cultural idea, not confined to Academia (cf. Borges brilliant 1941 essayEl Jardin de senderos que se bifurcan).
van Benthem, J., Pacuit, E.
openaire +3 more sources
Certain Bounds of Formulas in Free Temporal Algebras
In this paper, we give a basic structure theorem based on the study of extreme cases for the value of ≺ (the classical precedence relation between ultrafilters), i.e., ≺=∅ and no isolated element in ≺.
Francisco Miguel García-Olmedo +2 more
doaj +1 more source
Formal Verification of Three-Valued Digital Waveforms
We investigate a formal verification problem (mathematically rigorous correctness checking) for digital waveforms used in practical development of digital microelectronic devices (digital circuits) at early design stages.
Nina Yu. Kutsak, Vladislav V. Podymov
doaj +1 more source
Optimal Control of Colored Timed Petri Nets Under Generalized Mutual Exclusion Temporal Constraints
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
Revising the Classic Computing Paradigm and Its Technological Implementations
Today’s computing is based on the classic paradigm proposed by John von Neumann, three-quarters of a century ago. That paradigm, however, was justified for (the timing relations of) vacuum tubes only. The technological development invalidated the classic
János Végh
doaj +1 more source
Design of the Sequential System Automata using Temporal Equivalence Classes [PDF]
A design method of sequential system automata using temporal logic specifications is proposed in this paper. The method is based on well-known Z.Manna and P.Wolper temporal logic satisfiability analysis procedure [1] and is extended to include past time ...
A. Ursu, G. Gruita, S. Zaporojan
doaj
How do genomes gain new functional parts? In eukaryotes, which tend to evolve under weak selection, much of the genome is junk. Palazzo and Qiu borrow the logic of Markov chains to show how non‐functional DNA becomes functional through the appearance of intermediate states, which arise due to epistasis, buffering, and biochemical messiness, allowing ...
Alexander F. Palazzo, Yi Qiu
wiley +1 more source

