Results 191 to 200 of about 101,990 (219)
Some of the next articles are maybe not open access.
1978
The approach of characterising certain properties of concurrent structures by traces, i.e. partial orders of event occurrences has already been used by several authors in particular by S. Patil, A.W. Holt, P.E. Lauer. The approach also has a close connection to causal-nets introduced by C.A. Petri.
openaire +1 more source
The approach of characterising certain properties of concurrent structures by traces, i.e. partial orders of event occurrences has already been used by several authors in particular by S. Patil, A.W. Holt, P.E. Lauer. The approach also has a close connection to causal-nets introduced by C.A. Petri.
openaire +1 more source
Partially ordered interpretations
Journal of Symbolic Logic, 1977In this paper, we shall define the “partially ordered interpretation” of a first order theory in another first order theory and state some recent results. Although an exact definition will be given in §4 below, we now give a brief outline. First of all, let us recall the “interpretations” defined by A. Tarski et al.
openaire +2 more sources
On the T-partial order and properties
Information Sciences, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emel Asici, Funda Karaçal
openaire +2 more sources
2000
Partial order reductions are a family of techniques for diminishing the statespace explosion problem for model-checking concurrent programs. They are based on the Observation that execution sequences of a concurrent program can be grouped together into equivalence classes that are indistinguishable by the property to be checked.
openaire +1 more source
Partial order reductions are a family of techniques for diminishing the statespace explosion problem for model-checking concurrent programs. They are based on the Observation that execution sequences of a concurrent program can be grouped together into equivalence classes that are indistinguishable by the property to be checked.
openaire +1 more source
1999
Many of the semirings originally studied, such as ℕ and ideal(R), have a partial-order structure in addition to their algebraic structure and, indeed, the most interesting theorems concerning them make use of the interplay between these two structures.
openaire +1 more source
Many of the semirings originally studied, such as ℕ and ideal(R), have a partial-order structure in addition to their algebraic structure and, indeed, the most interesting theorems concerning them make use of the interplay between these two structures.
openaire +1 more source
A partially ordered extention of the integers
Studia Logica, 1995This paper consists of two parts. In Part I, the authors present a monotonic system of Post algebras of order \(\omega + \omega^*\) whose chain of Post constants is isomorphic with \(0 \leq 1 \leq 2 \leq \cdots \leq -3 \leq -2 \leq -1\). The basic development of the theory is presented and the study of filters and representability is discussed. Besides
George Epstein, Helena Rasiowa
openaire +1 more source
On the Complexity of Partial Order Productions
SIAM Journal on Computing, 1989The paper deals with the following (P-production) problem: Let \(P=(
openaire +2 more sources
Symmetries of the Partial Order of Traces
Order, 1999Free partially commutative monoids, also called trace monoids, were introduced by \textit{P. Cartier} and \textit{D. Foata} [Problèmes combinatoires de commutation et réarrangements (Lect. Notes Math. 85) (Springer, Berlin) (1969; Zbl 0186.30101)]. There is a broad research on this topic in theoretical computer science.
openaire +1 more source
Statistical Models for Partial Orders Based on Data Depth and Formal Concept Analysis
Communications in Computer and Information Science, 2022Hannah Blöcher +2 more
exaly