نتایج جستجو برای: discrete trace transition system
تعداد نتایج: 2610063 فیلتر نتایج به سال:
We consider here Linear Temporal Logic (LTL) formulas interpreted over finite traces. We denote this logic by LTLf . The existing approach for LTLf satisfiability checking is based on a reduction to standard LTL satisfiability checking. We describe here a novel direct approach to LTLf satisfiability checking, where we take advantage of the difference in the semantics between LTL and LTLf . Whil...
the possible relationships between trace elements, oxidative stress and subclinical ketosis during the transition period were evaluated in dairy cows. blood samples were obtained by jugular venipuncture at four times of the transition period: 3 weeks and 1 week before and 1 week and 3 weeks after calving. the highest concentrations of malondialdehyde (mda) and betahydroxybutyrate (bhb) were obs...
1 The goal of testing is to make statements about the relation between the traces of an implementation and a temporal property. This is not possible for all temporal properties. Within this paper safety and guarantee properties are identi ed to be testable temporal properties and for these testable properties a test case de nition is given. This is done by representing a safety property as a la...
An automaton with concurrency relations A is a labeled transition system with a collection of binary relations indicating when two actions in a given state of the automaton can occur independently of each other. The concurrency relations induce a natural equivalence relation for nite computation sequences. We investigate two graph-theoretic representations of the equivalence classes of computat...
We show that a set with an action of a locally finite-dimensional free partially commutative monoid and the corresponding semicubical set have isomorpic homology groups. We build a complex of finite length for the computing homology groups of any asynchronous transition system with finite maximal number of mutually independent events. We give examples of computing the homology groups. 2000 Math...
A (discrete) dynamical system may have various symmetries and reversing symmetries, which together form its so-called reversing symmetry group. We study the set of 3D trace maps (obtained from two-letter substitution rules) which preserve the Fricke-Vogt invariant I(x, y, z). This set of dynamical systems forms a group G isomorphic with the projective linear (or modular) group PGl(2, Z ). For s...
We consider discrete one-dimensional Schrr odinger operators with quasi-Sturmian potentials. We present a new approach to the trace map dy-namical system which is independent of the initial conditions and establish a characterization of the spectrum in terms of bounded trace map orbits. Using this, it is shown that the operators have purely singular continuous spectrum and their spectrum is a C...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید