• Deciding Origin Equivalence of Weakly Self-Nesting Macro Tree Transducers Sebastian Maneth, Helmut Seidl.

We consider a notion of origin for deterministic macro tree transducers with look-ahead which records for each output node, the corresponding input node for which a rule-application generated that output node. With respect to this ...

The parallel time of a population protocol is defined as the average number of required interactions in which an agent in the protocol participates, i.e., the quotient between the total number of interactions required by the protocol ...

• Logarithmic lower bound on expected number of parallel steps needed to run n interactions.

• A notion of asynchronous test equivalence for probabilistic processes has been formulated.

Each probabilistic process exhibits a kind of input-output behaviour when subjected to asynchronous testing. This behaviour is called the asynchronous test behaviour of the process. When the system under test is comprised of multiple ...

We consider the online search problem in which a server starting at the origin of a d-dimensional Euclidean space has to find an arbitrary hyperplane. The best-possible competitive ratio and the length of the shortest curve from which ...

• In d-dimensional Euclidean Space, the Online Hyperplane Search Problem is asymptotically equivalent to the Sphere Inspection Problem.

Polynomial Interrupt Timed Automata (PolITA) are finite automata with clocks organized along hierarchical levels. These clocks are equipped with an interruption mechanism, well suited to the modeling of real-time operating systems. ...

• Polynomial Interrupt Timed Automata feature clock interruptions and polynomial constraints on clocks.

• The randomized consensus algorithm of Aspnes and Herlihy, which was shown to work with atomic registers, works even with regular registers.

The well-known randomized consensus algorithm by Aspnes and Herlihy (1990) for asynchronous shared-memory systems was proved to work, even against a strong adversary, under the assumption that the registers that it uses are atomic. ...

We give a new proof of the result of Comon and Jurski that the binary reachability relation of a timed automaton is definable in linear arithmetic.

• New proof for definability of the reachability relation of timed automata.
• It ...

• The main result provides an algorithm which decides whether two tree-automatic ordinals with addition are isomorphic.

This paper studies tree-automatic ordinals (or equivalently, well-founded linearly ordered sets) together with the ordinal addition operation +. Informally, these are ordinals such that their elements are coded by finite trees for ...

We show that the shuffle L ⊔ ⊔ F of a piecewise-testable language L and a finite language F is piecewise-testable. The proof relies on a classic but little-used automata-theoretic characterization of piecewise-testable languages. We ...

• We prove that the shuffle L ⊔ ⊔ F of a piecewise-testable language L with a finite language F is piecewise-testable.

• The Hales–Jewett theorem is equivalent to a problem in communication complexity.

For integers n and k, the density Hales–Jewett number c n , k is defined as the maximal size of a subset of [ k ] n that contains no combinatorial line. We show that for k ≥ 3 the density Hales–Jewett number c n , k is ...

A simple necessity proof for k-set agreement.It answers a computability issue.The proof covers synchronous and asynchronous systems. This short paper presents a necessary condition for Byzantine k-set agreement in (synchronous or asynchronous) message-...

The online parallel-batch scheduling problem on single unbounded machine to minimize total weighted job completion time is studied. For the general case of processing time, we give an online algorithm with competitive ratio 5 + 1 . When all jobs have ...

The textbook method for converting a first-order logic formula to prenex normal form potentially leads to an exponential growth of the formula size, if the formula is allowed to use all of the classical logical connectives , , , , . This note presents a ...

We show that the problem whether a given Petri net has a home state (a marking reachable from every reachable marking) is decidable, and at least as hard as the reachability problem. Existence of home states in Petri nets is decidable.Reachability can ...

We investigate localized work stealing, a variant of work stealing that exploits locality.In localized work stealing, when a processor is free, it makes a steal attempt to get back its own work.The expected running time of the localized work-stealing ...

Revisiting the problem of de-randomizing approximate counting.We study approximation problems in the space-bounded model motivated by quantum algorithms for linear algebraic problems.Deterministic logspace approximation schemes under de-randomization ...

We investigate the complexity of primal logic with disjunction according to the Kripke semantics as defined in 1] and the quasi-boolean semantics as defined in 2]. We show that the validity problem is coNP -complete, even for variable-free sequents. For ...

This paper offers a finite, ground-complete axiomatization of stateless bisimilarity over the tuple-space-based coordination language Linda. As stepping stones towards that result, axiomatizations of stateless bisimilarity over the sequential fragment ...

Hypersequent calculus HC for three modal logics of linear frames (K4.3, KD4.3 and S4.3) is presented.Adequacy of HC for these logics is shown.Eliminability of Cut is demonstrated. Hypersequent calculi, introduced independently by Pottinger and Avron, ...

Opacity is a security property that guarantees that no information leaks in a system.We study opacity in systems modeled by Markov decision processes.For classical MDP, the value of the probabilistic disclosure is computable.In POMDP, most of the ...