scholarly journals Compositional Analysis of Protocol Equivalence in the Applied $$\pi $$-Calculus Using Quasi-open Bisimilarity

2021 ◽  
pp. 235-255
Author(s):  
Ross Horne ◽  
Sjouke Mauw ◽  
Semen Yurkov
Keyword(s):  
Compositional Analysis ◽  
Equivalence Problem ◽  
Security And Privacy ◽  
Compositional Approach ◽  
Pi Calculus ◽  
Equivalence Problems ◽  
Do So

AbstractThis paper shows that quasi-open bisimilarity is the coarsest bisimilarity congruence for the applied $$\pi $$ π -calculus. Furthermore, we show that this equivalence is suited to security and privacy problems expressed as an equivalence problem in the following senses: (1) being a bisimilarity is a safe choice since it does not miss attacks based on rich strategies; (2) being a congruence it enables a compositional approach to proving certain equivalence problems such as unlinkability; and (3) being the coarsest such bisimilarity congruence it can establish proofs of some privacy properties where finer equivalences fail to do so.

scholarly journals The Application of Translation Strategies to Cope With Equivalence Problems in Translating Texts

2018 ◽  
Vol 1 (1) ◽  
pp. 1-9
Author(s):  
Dhini Aulia
Keyword(s):  
Equivalence Problem ◽  
Target Language ◽  
Source Text ◽  
Translation Process ◽  
Translation Strategies ◽  
Source Language ◽  
Specific Concept ◽  
Equivalence Problems

Translation is a process to render the meaning from the source text into the target text. A translator, however, will find some problems during translation process. Equivalence is the case which often appears (i.e. culture specific concept, the source-language concept is not lexicalized in the target language, source-language word is semantically complex, etc). To cope with equivalnce problems in translation process, some experts suggest some strategies which can be applied in doing translation. Some strategies are transference, naturalization, cultural equivalent, etc. The strategies which often appears in the example texts in this paper are transference, naturalization, descriptive equivalent, couplet and  through-translation. It is recomended that translator apply the strategies if only there is no equivalence problem in target language. 

scholarly journals The morphosemantics of Spanish indefinites

2016 ◽  
Vol 25 ◽  
pp. 576
Author(s):  
Luisa Martí
Keyword(s):  
Compositional Analysis ◽  
Common Assumption ◽  
The Common ◽  
Do So

I analyze the Spanish indefinites algún and algunos as a paucal and a greater paucal determiner, respectively, contrary to the common assumption that views the former as singular and the latter as plural. I use Harbour’s  (2014) feature [±additive], and the possibility of repeating that feature, in order to do so. I propose a transparent word-internal compositional analysis of the two determiners, where alg- contributes [−additive] to both of them. I discuss consequences for the semantics of morphological plurality in nouns and for the analysis of ignorance implicatures.

scholarly journals On the Decidability of some Equivalence Problems for D0L-Systems

1973 ◽  
Vol 2 (20) ◽  
Author(s):  
Mogens Nielsen
Keyword(s):  
Open Problem ◽  
Equivalence Problem ◽  
Lindenmayer Systems ◽  
L Systems ◽  
And Control ◽  
Equivalence Problems

One of the questions of the longest open standing in the area of Lindenmayer-systems is the decidability of the equivalence problem for deterministic, informationless L-systems (DOL-Systems). This and some related equivalence-problems (equivalence with respect to the set and the sequence of generated words, Parikh-vectors and word-lengths) are investigated. Some of these related problems are shown to be recursively solvable, and the implications of these results on the main open problem mentioned above are discussed. (The paper has been accepted for publication in Information and Control).

Resolution of well-known resistivity equivalences by inclusion of time-domain induced polarization data

Geophysics ◽  
2018 ◽  
Vol 83 (1) ◽  
pp. E47-E54 ◽  
Author(s):  
Line Meldgaard Madsen ◽  
Gianluca Fiandaca ◽  
Anders Vest Christiansen ◽  
Esben Auken
Keyword(s):  
Time Domain ◽  
Equivalence Problem ◽  
Induced Polarization ◽  
Monte Carlo Algorithm ◽  
High Resistivity ◽  
Inversion Method ◽  
Model Parameters ◽  
Clay Layer ◽  
Equivalent Models ◽  
Equivalence Problems

The principle of equivalence is known to cause nonuniqueness in interpretations of direct current (DC) resistivity data. Low- or high-resistivity equivalences arise when a thin geologic layer with a low/high resistivity is embedded in a relative high-/low-resistivity background formation causing strong resistivity-thickness correlations. The equivalences often make it impossible to resolve embedded layers. We found that the equivalence problem could be significantly reduced by combining the DC data with full-decay time-domain induced polarization (IP) measurements. We applied a 1D Markov chain Monte Carlo algorithm to invert synthetic DC data of models with low- and high-resistivity equivalences. By applying this inversion method, it is possible to study the space of equivalent models that have an acceptable fit to the observed data, and to make a full sensitivity analysis of the model parameters. Then, we include a contrast in chargeability into the model, modeled in terms of spectral Cole-Cole IP parameters, and invert the DC and IP data in combination. The results show that the addition of IP data largely resolves the DC equivalences. Furthermore, we present a field example in which DC and IP data were measured on a sand formation with an embedded clay layer known from a borehole drilling. Inversion results show that the DC data alone do not resolve the clay layer due to equivalence problems, but by adding the IP data to the inversion, the layer is resolved.

On the Decidability of Some Equivalence Problems for L Algebraic Series

1997 ◽  
Vol 07 (03) ◽  
pp. 339-351 ◽  
Author(s):  
Juha Honkala
Keyword(s):  
Equivalence Problem ◽  
Special Cases ◽  
Equivalence Problems

The equivalence problem for Lindenmayerian algebraic series is discussed. While the problem in general is undecidable, decidable special cases of interest are presented.

scholarly journals The geometry of fourth-order differential operator

2015 ◽  
Vol 12 (05) ◽  
pp. 1550055
Author(s):  
Rohollah Bakhshandeh-Chamazkoti
Keyword(s):  
Fourth Order ◽  
Differential Operators ◽  
Necessary Conditions ◽  
Equivalence Problem ◽  
Order Differential Operator ◽  
General Fiber ◽  
Gauge Equivalence ◽  
Sufficient And Necessary Conditions ◽  
Fourth Order Differential Operator ◽  
Equivalence Problems

In the present paper, the equivalence problem for fourth-order differential operators with one variable under general fiber-preserving transformation using the Cartan method of equivalence is applied. Two versions of equivalence problems are considered. First, the direct equivalence problem and second equivalence problem is to determine the sufficient and necessary conditions on two fourth-order differential operators such that there exists a fiber-preserving transformation mapping one to the other according to gauge equivalence.

THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM

2005 ◽  
Vol 15 (02) ◽  
pp. 317-326 ◽  
Author(s):  
STEVE SEIF
Keyword(s):  
Finite Semigroup ◽  
Equivalence Problem ◽  
Rees Matrix Semigroups ◽  
Term Equivalence ◽  
Finite Semigroups ◽  
Finite Word ◽  
Np Complete ◽  
Equivalence Problems ◽  
Matrix Semigroups

A semigroup term is a finite word in the alphabet x1, x2,…. The length of a term p, denoted by |p|, is the number of variables in p, including multiplicities. The term-equivalence problem for a finite semigroup S has as an instance a pair of terms {p,q} with size |p| + |q| and asks whether p ≈ q is an identity over S. It is proved here that [Formula: see text], the six-element Perkins semigroup, has co-NP-complete term-equivalence problem, a result which leads to the completion of the classification of he term-equivalence problems for monoid extensions of aperiodic Rees matrix semigroups. From the main result it follows that there exist finite semigroups with tractable term-equivalence problems but having subsemigroups and homomorphic images with co-NP-complete term-equivalence problems.

scholarly journals Restrictive Acceptance Suffices for Equivalence Problems

2000 ◽  
Vol 3 ◽  
pp. 86-95 ◽  
Author(s):  
Bernd Borchert ◽  
Lane A. Hemaspaandra ◽  
Jörg Rothe
Keyword(s):  
Upper Bound ◽  
Equivalence Problem ◽  
Decision Diagrams ◽  
Ordered Binary Decision Diagrams ◽  
Binary Decision ◽  
Strength Of Evidence ◽  
Np Complete ◽  
Np Problems ◽  
Np Problem ◽  
Equivalence Problems

AbstractOne way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence but more broadly applicable—for suggesting that concrete NP problems are not NP-complete. In particular, we introduce the promise class EP, the subclass of NP consisting of those languages accepted by NP machines that, when they accept, always have a number of accepting paths that is a power of two. We show that FewP, bounded ambiguity polynomial time (which contains UP), is contained in EP. The class EP applies as an upper bound to some concrete problems to which previous approaches have never been successful, for example the negation equivalence problem for OBDDs (ordered binary decision diagrams).

scholarly journals A COMPOSITIONAL APPROACH FOR TRAFFIC DISTRIBUTION EVALUATION OF TRIPLE LEFT-TURN LANES FROM AN INDIVIDUAL PERSPECTIVE

Transport ◽  
2021 ◽  
Vol 36 (2) ◽  
pp. 110-122
Author(s):  
Li Li ◽  
Dong Zhang ◽  
Xiao-Yun Cheng ◽  
Ping Wang ◽  
Gui-Ping Wang
Keyword(s):  
Traffic Control ◽  
Compositional Data ◽  
Compositional Analysis ◽  
Independent Effect ◽  
Signal Phase ◽  
Left Turn ◽  
Joint Effects ◽  
Traffic Distribution ◽  
Compositional Approach ◽  
Phase Cycle

This study analysed unbalanced traffic distribution on Triple Left-Turn Lanes (TLTLs) at signalized intersections that is caused by left-turn drivers’ unequal lane preferences. To develop statistical bonding between the multilane traffic flow and individual lane choices, the lane volumes are formatted as compositional data to subject the sum-constant constraint. One-way and two-way Compositional ANalysis Of VAriance (CANOVA) models were formulated respectively to estimate the independent effect of one factor and its joint effects with other factors on the multilane traffic distribution. TLTL volume composition was the dependent variable of the models, while the factors of geometric design and traffic control that could affect left-turn drivers’ lane choice were the independent variables. Results indicate that variance of vehicle turning curve, length of the upstream segment, the location of triple left-turn sign, signal phase / cycle length, could affect the traffic distribution, and its balance could be achieved at specific levels of a factor. The joint effects of some factor couples could improve the unbalanced traffic distribution while others could not work.

scholarly journals The Growth Range Equivalence Problem for D0L Systems is Decidable

1975 ◽  
Vol 4 (50) ◽  
Author(s):  
Jean Berstel
Keyword(s):  
Equivalence Problem ◽  
Growth Functions ◽  
Equivalence Problems

<p>The decidability of equivalence problems for DOL systems has been studied in various papers. One of the questions left open in these papers, is the decidability of what one might call the growth range equivalence problem. Two DOL systems are said to be equivalent if the ranges of their growth functions coincide. This problem is proved to be decidable.</p><p>Published in: A. Lindenmayer &amp; G. Rozenberg (ed.) Automata, Languages and Development, North-Holland, 1976.</p>

Sign in / Sign up

Export Citation Format

Share Document