Results 11 to 20 of about 721,848 (214)
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
Weak Alternating Timed Automata [PDF]
Logical Methods in Computer Science, 2012 Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable.
Pawel Parys, Igor Walukiewicz
doaj +1 more source
Lindstrom theorems for fragments of first-order logic [PDF]
Logical Methods in Computer Science, 2009 Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic.
Johan van Benthem +2 more
doaj +1 more source
Untyping Typed Algebras and Colouring Cyclic Linear Logic [PDF]
Logical Methods in Computer Science, 2012 We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations.
Damien Pous
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
Reachability and liveness in parametric timed automata [PDF]
Logical Methods in Computer Science, 2022 We study timed systems in which some timing features are unknown parameters. Parametric timed automata (PTAs) are a classical formalism for such systems but for which most interesting problems are undecidable.
Étienne André +2 more
doaj +1 more source
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness [PDF]
Logical Methods in Computer Science, 2007 We consider Dense-Timed Petri Nets (TPN), an extension of Petri nets in which each token is equipped with a real-valued clock and where the semantics is lazy (i.e., enabled transitions need not fire; time can pass and disable transitions).
Parosh Abdulla +2 more
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
Coalgebras for Bisimulation of Weighted Automata over Semirings [PDF]
Logical Methods in Computer Science, 2023 Weighted automata are a generalization of nondeterministic automata that associate a weight drawn from a semiring $K$ with every transition and every state.
Purandar Bhaduri
doaj +1 more source