Results 21 to 30 of about 882,949 (238)
Game Refinement Relations and Metrics [PDF]
Logical Methods in Computer Science, 2008 We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a successor state.
Luca de Alfaro +3 more
doaj +1 more source
Weighted Logics for Nested Words and Algebraic Formal Power Series [PDF]
Logical Methods in Computer Science, 2010 Nested words, a model for recursive programs proposed by Alur and Madhusudan, have recently gained much interest. In this paper we introduce quantitative extensions and study nested word series which assign to nested words elements of a semiring. We show
Christian Mathissen
doaj +1 more source
Well Behaved Transition Systems [PDF]
Logical Methods in Computer Science, 2017 The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weakest hypothesis that implies decidability of the coverability problem.
Michael Blondin +2 more
doaj +1 more source
Domain Representable Spaces Defined by Strictly Positive Induction [PDF]
Logical Methods in Computer Science, 2010 Recursive domain equations have natural solutions. In particular there are domains defined by strictly positive induction. The class of countably based domains gives a computability theory for possibly non-countably based topological spaces. A $ qcb_{0} $
Petter Kristian Køber
doaj +1 more source
The Wadge Hierarchy of Deterministic Tree Languages [PDF]
Logical Methods in Computer Science, 2008 We provide a complete description of the Wadge hierarchy for deterministically recognisable sets of infinite trees. In particular we give an elementary procedure to decide if one deterministic tree language is continuously reducible to another.
Filip Murlak
doaj +1 more source
Transforming Outermost into Context-Sensitive Rewriting [PDF]
Logical Methods in Computer Science, 2010 We define two transformations from term rewriting systems (TRSs) to context-sensitive TRSs in such a way that termination of the target system implies outermost termination of the original system.
Joerg Endrullis, Dimitri Hendriks
doaj +1 more source
Weighted Regular Tree Grammars with Storage [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids.
Zoltán Fülöp +2 more
doaj +1 more source
Sampled Semantics of Timed Automata [PDF]
Logical Methods in Computer Science, 2010 Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems with a fixed granularity of time, the abstract character of the latter makes it appealing ...
Pavel Krcal +2 more
doaj +1 more source
Logical Methods in Computer Science, 2017 Kleene algebra axioms are complete with respect to both language models and binary relation models. In particular, two regular expressions recognise the same language if and only if they are universally equivalent in the model of binary relations.
Paul Brunet, Damien Pous
doaj +1 more source
The Complexity of Iterated Reversible Computation [PDF]
TheoretiCS, 2023 We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its definition, and in
David Eppstein
doaj +1 more source