We prove that deciding language equivalence of deterministic realtime one-counter automata is NL-complete, in stark contrast to the inclusion problem which is known to be undecidable. This yields a subclass of deterministic pushdown automata for which the precise complexity of the equivalence problem can be determined. Moreover, we show that deciding regularity is NL-complete as well.

MLL proof equivalence is the problem of deciding whether two proofs in multiplicative linear logic are related by a series of inference permutations. It is also known as the word problem for ∗-autonomous categories. Previous work has shown the problem to be equivalent to a rewiring problem on proof nets, which are not canonical for full MLL due to the presence of the two units. Drawing from rec...

The article deals with the problem of proving observational equivalence for the class of computational processes called processes with message passing. These processes can execute actions of the following forms: sending or receiving of messages, checking logical conditions and updating values of internal variables of processes. Our main result is a theorem that reduces the problem of proving ob...

In this paper, we consider the control of general hybrid systems. Surprisingly, time-abstract bisimulation is not fine enough for solving such a problem. Conversely, we show that suffix equivalence is a correct abstraction for that problem. We apply this equivalence to ominimal hybrid systems and get decidability and computability results in this framework.

The problem of deciding the probability model equivalence of two PRISM programs is addressed. In the finite case this problem can be solved (albeit slowly) using techniques from algebraic statistics, specifically the computation of elimination ideals and Gröbner bases. A very brief introduction to algebraic statistics is given. Consideration is given to cases where shortcuts to proving/disprovi...

We will discuss severai recentI) developed :e_h.ci;ues for prcving the decidability of the equivalence problem for devices den #III& languages and relations. Most of these techniques come from the development originat,d 1;1 the proof of the decidability of the DOL equivalence problem. Of particular importance is c.te recently shown validity of the Ehrenieucht conjecture and its effective variat...

This dissertation contributes to analysis methods for infinite-state systems. The dissertation focuses on equivalence testing for two relevant classes of infinite-state systems: commutative context-free processes, and one-counter automata. As for equivalence notions, we investigate the classical bisimulation and simulation equivalences. The important point is that we allow for silent steps in t...

We discuss the problem of comparing the behavioural equivalence of partially observable systems with observations. We examine different types of equivalence relations on states, and show that branching equivalence relations are stronger than linear ones. Finally, we discuss how this hierarchy can be used in duality theory.

technical terminology has a significant role in translation of technical or scientific texts. unfortunately, most of research in this area has not perceived the urgent need for a model to analyze or shown how translate technical or scientific terminology. in this paper, the researcher attempts to designs a workable model for translation of technical or scientific terminology. the major aim of t...

The essential point will be the equivalence of the norm of the error, which should be estimated, and a corresponding dual norm of the residual which only involves the given data of the problem and the computed numerical solution. This equivalence is a consequence of the stability of the infinite dimensional variational problem. Thus, in a posteriori error analysis the situation is quite differe...