Results 121 to 130 of about 78,692 (167)

Alphabets of Acyclic Invariant Structures [PDF]

open access: possibleFundamenta Informaticae, 2017
A step trace is an equivalence class of step sequences, where the equivalence is determined by dependencies between pairs of actions expressed as potential simultaneity and sequentialisability. Step traces can be represented by invariant structures with two relations: mutual exclusion and (possibly cyclic) weak causality.
Janicki, R.   +3 more
openaire   +3 more sources
Some of the next articles are maybe not open access.

Related searches:

Invariant structure in locomotion

Neuroscience, 1988
Biological systems are hypothesized to control behavior with reference to invariants, because this would allow the variable but robust accomplishment of tasks observed in biological behaviors. Invariants for legged locomotion are specified. Combined with observed properties of locomotion, they lead to predictions of forms of control for legged ...
P, Das, G, McCollum
openaire   +2 more sources

Structure of index invariant systems

1971 IEEE Conference on Decision and Control, 1971
This paper introduces the concept of a controllability module and then uses it to study certain algebraic properties of index-invariant, time-varying, linear systems. It is shown that controllability modules possess a property similar to the pole placement property of controllability subspaces.
Morse, A. S., Silverman, L. M.
openaire   +2 more sources

Invariant Structures and Dependence Relations

Fundamenta Informaticae, 2017
A step trace is an equivalence class of step sequences which can be thought of as different observations of the same underlying concurrent history. Equivalence is determined on basis of a step alphabet that describes the relations between events in terms of potential simultaneity and sequentialisability.
Janicki, R.   +3 more
openaire   +4 more sources

Structural Invariants

2006
We present structural invariants (SI), a new technique for incrementally overapproximating the verification condition of a program in static single assignment form by making a linear pass over the dominator tree of the program. The 1-level SI at a program location is the conjunction of all dominating program statements viewed as constraints. For any k,
Ranjit Jhala, Rupak Majumdar, Ru-Gang Xu
openaire   +1 more source

Home - About - Disclaimer - Privacy