Sciweavers

18 search results - page 3 / 4
» A Solver for Modal Fixpoint Logics
Sort
View
LMCS
2007
132views more  LMCS 2007»
14 years 11 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
CAV
2004
Springer
101views Hardware» more  CAV 2004»
15 years 5 months ago
Symbolic Model Checking of Non-regular Properties
This paper presents a symbolic model checking algorithm for Fixpoint Logic with Chop, an extension of the modal µ-calculus capable of defining non-regular properties. Some empiri...
Martin Lange
JANCL
2006
105views more  JANCL 2006»
14 years 11 months ago
BDD-based decision procedures for the modal logic K
We describe BDD-based decision procedures for the modal logic K. Our approach is inspired by the automata-theoretic approach, but we avoid explicit automata construction. Instead, ...
Guoqiang Pan, Ulrike Sattler, Moshe Y. Vardi
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 11 months ago
Characterising Probabilistic Processes Logically
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
Yuxin Deng, Rob J. van Glabbeek
BIRTHDAY
2010
Springer
15 years 22 days ago
DKAL and Z3: A Logic Embedding Experiment
Yuri Gurevich and Itay Neeman proposed the Distributed Knowledge Authorization Language, DKAL, as an expressive, yet very succinctly expressible logic for distributed authorization...
Sergio Mera, Nikolaj Bjørner