Results 1 to 10 of about 220,461 (141)
Full abstraction for fair testing in CCS (expanded version) [PDF]
In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent form of presheaf semantics and as a concurrent form of game semantics.
Tom Hirschowitz
doaj +7 more sources
A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity [PDF]
Milner (1984) defined an operational semantics for regular expressions as finite-state processes. In order to axiomatize bisimilarity of regular expressions under this process semantics, he adapted Salomaa's proof system that is complete for equality of ...
Clemens Grabmayer
doaj +1 more source
Counterfactuals, counteractuals, and free choice [PDF]
In a recent paper, Pruss proves the validity of the rule beta-2 relative to Lewis’s semantics for counterfactuals, which is a significant step forward in the debate about the consequence argument.
Lampert, Fabio, Merlussi, Pedro
core +1 more source
A Perturbed Milne’s Quadrature Rule for n-Times Differentiable Functions with Lp-Error Estimates
In this work, a perturbed Milne’s quadrature rule for n-times differentiable functions with Lp-error estimates is derived. One of the most important advantages of our result is that it is verified for p-variation and Lipschitz functions.
Ayman Hazaymeh +4 more
doaj +1 more source
Superfolds are folds commonly observed among evolutionarily unrelated multiple superfamilies of proteins. Since discovering superfolds almost two decades ago, structural rules distinguishing superfolds from the other ordinary folds have been explored but
Takumi Nishina +3 more
doaj +1 more source
In real-life communication, individuals use language that carries evident rewarding and punishing elements, such as praise and criticism. A common trend is to seek more praise while avoiding criticism.
Linyan Liu +4 more
doaj +1 more source
We study the robustness of the cμ-rule for the optimal allocation of a resource consisting of one unreliable server to parallel queues with two different classes of customers.
Dmitry Efrosinin +2 more
doaj +1 more source
Analysis of high-dimensional data, with more features (p) than observations (N) (p>N), places significant demand in cost and memory computational usage attributes. Feature selection can be used to reduce the dimensionality of the data.
Consolata Gakii +2 more
doaj +1 more source
Structured Operational Semantics for Graph Rewriting [PDF]
Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics (LTS). While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general ...
A. Dorman, T. Heindel, B. König
doaj +1 more source
Characterization of All Graphs with a Failed Skew Zero Forcing Number of 1
Given a graph G, the zero forcing number of G, Z(G), is the minimum cardinality of any set S of vertices of which repeated applications of the forcing rule results in all vertices being in S.
Aidan Johnson +2 more
doaj +1 more source

