Sciweavers

711 search results - page 110 / 143
» Modal Logics are Coalgebraic
Sort
View
ITA
2007
14 years 10 months ago
Three notes on the complexity of model checking fixpoint logic with chop
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
Martin Lange
ATAL
2010
Springer
14 years 11 months ago
Reasoning about strategies of multi-agent programs
Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent...
Mehdi Dastani, Wojciech Jamroga
MSCS
2006
87views more  MSCS 2006»
14 years 10 months ago
Differential categories
This paper revisits the authors' notion of a differential category from a different perspective. A differential category is an additive symmetric monoidal category with a como...
Richard Blute, J. Robin B. Cockett, R. A. G. Seely
CAV
2004
Springer
101views Hardware» more  CAV 2004»
15 years 3 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
AML
2007
95views more  AML 2007»
14 years 10 months ago
Complexity of admissible rules
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
Emil Jerábek