Results 31 to 40 of about 882,949 (238)
Algorithms for Game Metrics [PDF]
Logical Methods in Computer Science, 2010 Simulation and bisimulation metrics for stochastic systems provide a quantitative generalization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative specifications written in
Krishnendu Chatterjee +3 more
doaj +1 more source
Computational Models of Certain Hyperspaces of Quasi-metric Spaces [PDF]
Logical Methods in Computer Science, 2011 In this paper, for a given sequentially Yoneda-complete T_1 quasi-metric space (X,d), the domain theoretic models of the hyperspace K_0(X) of nonempty compact subsets of (X,d) are studied.
Massoud Pourmahdian, Mahdi Ali-Akbari
doaj +1 more source
Neighbourhood Structures: Bisimilarity and Basic Model Theory [PDF]
Logical Methods in Computer Science, 2009 Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic.
Helle Hvid Hansen +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
Non-Obfuscated Unprovable Programs & Many Resultant Subtleties [PDF]
Logical Methods in Computer Science, 2016 The \emph{International Obfuscated C Code Contest} was a programming contest for the most creatively obfuscated yet succinct C code. By \emph{contrast}, an interest herein is in programs which are, \emph{in a sense}, \emph{easily} seen to be correct, but
John Case, Michael Ralston
doaj +1 more source
Enriched MU-Calculi Module Checking [PDF]
Logical Methods in Computer Science, 2008 The model checking problem for open systems has been intensively studied in the literature, for both finite-state (module checking) and infinite-state (pushdown module checking) systems, with respect to Ctl and Ctl*. In this paper, we further investigate
Alessandro Ferrante +2 more
doaj +1 more source
Towards a Minimal Stabilizer ZX-calculus [PDF]
Logical Methods in Computer Science, 2020 The stabilizer ZX-calculus is a rigorous graphical language for reasoning about quantum mechanics. The language is sound and complete: one can transform a stabilizer ZX-diagram into another one using the graphical rewrite rules if and only if these two ...
Miriam Backens +2 more
doaj +1 more source
EXPTIME Tableaux for the Coalgebraic mu-Calculus [PDF]
Logical Methods in Computer Science, 2011 The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic.
Corina Cirstea +2 more
doaj +1 more source
An Explicit Framework for Interaction Nets [PDF]
Logical Methods in Computer Science, 2010 Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. \Beta-reduction. Traditional presentations of interaction nets are based on graph theory and rely on elementary properties ...
Marc de Falco
doaj +1 more source
On the Expressive Power of Higher-Order Pushdown Systems [PDF]
Logical Methods in Computer Science, 2020 We show that deterministic collapsible pushdown automata of second order can recognize a language that is not recognizable by any deterministic higher-order pushdown automaton (without collapse) of any order.
Paweł Parys
doaj +1 more source