Results 1  10
of
1,235
Q P Modal Formula
"... S: set of states (may be infinite) R: transition relation between states R ⊆ S×S propositional symbols L: map from states to sets of prop. symbols L(s) denotes the set of prop. symbols that hold at state s∈SKripke Structure • K = 〈S, R, L〉 • G = 〈S, R〉 ..."
Abstract
 Add to MetaCart
S: set of states (may be infinite) R: transition relation between states R ⊆ S×S propositional symbols L: map from states to sets of prop. symbols L(s) denotes the set of prop. symbols that hold at state s∈SKripke Structure • K = 〈S, R, L〉 • G = 〈S, R〉
Graphical representation of covariantcontravariant modal formulae
 In EXPRESS
, 2011
"... formulae ..."
Two constructions of nonequivalent modal formulas1
"... Abstract. We discuss two constructions of nonequivalent modal formulas for normal modal logics. One is basically same as the dual of the construction in Moss [Mos07] and the other is the construction in [Sas05], [Sas08] and [Sas09]. The former is useful for any normal modal logics, while as in [Sas ..."
Abstract
 Add to MetaCart
Abstract. We discuss two constructions of nonequivalent modal formulas for normal modal logics. One is basically same as the dual of the construction in Moss [Mos07] and the other is the construction in [Sas05], [Sas08] and [Sas09]. The former is useful for any normal modal logics, while
A Checker For Modal Formulas For Processes With Data
 Proceedings of FMCO 2003, volume 3188 of LNCS
, 2002
"... We propose an algorithm for the automatic verification of firstorder modal calculus formulae on infinite state, datadependent processes. The use of boolean equation systems for solving the modelchecking problem in the finite case is wellstudied. In this paper, we extend on this solution, such th ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We propose an algorithm for the automatic verification of firstorder modal calculus formulae on infinite state, datadependent processes. The use of boolean equation systems for solving the modelchecking problem in the finite case is wellstudied. In this paper, we extend on this solution
Divide and congruence: From decomposition of modal formulas to preservation of branching and ηbisimilarity
 Inf. Comput
"... Abstract. We present a method for decomposing modal formulas for processes with the internal action τ . To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition us ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We present a method for decomposing modal formulas for processes with the internal action τ . To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition
A New System and Methodology for Generating Random Modal Formulae
 Automated Reasoning, First Int. Joint Conf., IJCAR 2001
, 2001
"... . Previous methods for generating random modal formulae (for the multimodal logic K (m) ) result either in flawed test sets or formulae that are too hard for current modal decision procedures and, also, unnatural. We present here a new system and generation methodology which results in unflawed ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
. Previous methods for generating random modal formulae (for the multimodal logic K (m) ) result either in flawed test sets or formulae that are too hard for current modal decision procedures and, also, unnatural. We present here a new system and generation methodology which results
Improving the Generation of Random Modal Formulae for Testing Decision Procedures
, 2001
"... . The recent emergence of heavilyoptimised modal decision procedures has lead to a number of generation methods for modal formulae. However, the generation methods developed so far are not satisfactory. To cope with this fact, we propose a much improved version of one of the bestknown methods, ..."
Abstract
 Add to MetaCart
. The recent emergence of heavilyoptimised modal decision procedures has lead to a number of generation methods for modal formulae. However, the generation methods developed so far are not satisfactory. To cope with this fact, we propose a much improved version of one of the bestknown methods
A Principle for Incorporating Axioms into the FirstOrder Translation of Modal Formulae
 Automated Deduction—CADE19, volume 2741 of Lecture Notes in Artificial Intelligence
, 2003
"... In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular properties such as transitivity, Euclideanness and functionality, to decidable logics. The goal of the axiomatic translation ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular properties such as transitivity, Euclideanness and functionality, to decidable logics. The goal of the axiomatic translation
Dynamic Logic
 Handbook of Philosophical Logic
, 1984
"... ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possibl ..."
Abstract

Cited by 1012 (7 self)
 Add to MetaCart
the effect of the execution of a program on the truth of a formula ', DL uses a modal construct <>', which
Results 1  10
of
1,235