Titlebook: Automata, Languages, and Programming; 41st International C Javier Esparza,Pierre Fraigniaud,Elias Koutsoupias Conference proceedings 2014 S

modifier

Toward a Structure Theory of Regular Infinitary Trace Languagesata – the class of deterministic Büchi automata being the most prominent among them. In this paper, we analyze the situation of regular languages of infinite Mazurkiewicz traces that model non-terminating, concurrent behaviors of distributed systems. Here, a corresponding classification is still mis

Incise

Unary Pushdown Automata and Straight-Line Programst accept exactly the unary regular languages, but can be exponentially more succinct than finite-state automata. We complete the complexity landscape for udpda by showing that emptiness (and thus universality) is .-hard, equivalence and compressed membership problems are .-complete, and inclusion is

现晕光

Robustness against Power is PSpace-completee features a relaxed memory model providing very weak guarantees with respect to the ordering and atomicity of memory accesses..Due to these weaknesses, some programs that are correct under sequential consistency (SC) show undesirable effects when run under Power. We say that these programs are not

hieroglyphic

绝缘

无效

Coalgebraic Weak Bisimulation from Recursive Equations over Monadsus classes of systems that exhibit richer transition behaviour. Nearly all of the ensuing notions are instances of the more general notion of .. Weak bisimulation, however, has so far been much less amenable to a coalgebraic treatment. Here we attempt to close this gap by giving a coalgebraic treatm

Sinus-Node

JAMB

暴露他抗议

Annkatrin Heuschkel,Claudia Rahnfeldy-iteration algorithm by Hoffman and Karp; show that both our algorithm and the classical value-iteration algorithm can approximate the value in exponential time; and identify a subclass where the value-iteration algorithm is a FPTAS. We also show that the exact value can be expressed in the existen

抵消