Results 1  10
of
140
Probabilistic Temporal Logics via the Modal MuCalculus
 In Foundations of Software Science and Computation Structures (FOSSACS 99
, 1999
"... This paper presents a mucalculusbased modal logic for describing properties of probabilistic labeled transition systems (PLTSs) and develops a modelchecking algorithm for determining whether or not states in finitestate PTLSs satisfy formulas in the logic. The logic is based on the distinction b ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
between (probabilistic) "systems" and (nonprobabilistic) "observations": using the modal mucalculus, one may specify sets of observations, and the semantics of our logic then enable statements to be made about the measures of such sets at various system states. The logic may be used
Vacuity Checking in the Modal MuCalculus
 In Proceedings of AMASTâ€™02, volume 2422 of LNCS
, 2002
"... Abstract. Vacuity arises when a logical formula is trivially true in a given model due, for example, to antecedent failure. Beer et al. have recently introduced a logicindependent notion of vacuity and shown that certain logics, i.e., those with polarity, admit an efficient decision procedure for v ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
for vacuity detection. We show that the modal mucalculus, a very expressive temporal logic, is a logic with polarity and hence the results of Beer et al. are applicable. We also extend the definition of vacuity to achieve a new notion of redundancy in logical formulas. Redundancy captures several forms
The mucalculus and modelchecking
"... This chapter presents a part of the theory of the mucalculus that is relevant to the, broadly understood, modelchecking problem. The mucalculus is one of the most important logics in modelchecking. It is a logic with an exceptional balance between expressiveness and algorithmic properties. The ..."
Abstract
 Add to MetaCart
. It gives a quite detailed explanation of the satisfiability algorithm, followed by the results on alternation hierarchy, proof systems, and interpolation. Finally, the chapter discusses the relations of the mucalculus to monadic secondorder logic as well as to some program and temporal logics. It also
Alternating Epistemic MuCalculus
"... Alternatingtime temporal logic (ATL) is a wellknown logic for reasoning about strategic abilities of agents. An important feature that distinguishes variants of ATL for imperfect information scenarios is that the standard fixed point characterizations of temporal modalities do not hold anymore. In ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Alternatingtime temporal logic (ATL) is a wellknown logic for reasoning about strategic abilities of agents. An important feature that distinguishes variants of ATL for imperfect information scenarios is that the standard fixed point characterizations of temporal modalities do not hold anymore
PartialOrder Reduction in the Weak Modal MuCalculus
 Proceedings of the Eighth International Conference on Concurrency Theory (CONCUR '97), volume 1243 of Lecture Notes in Computer Science
, 1997
"... . We present a partialorder reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mucalculus. We have implemented our technique in the Concurrency Factory specification and verification environment; experimental results show that part ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
that partialorder reduction can be highly effective in combating state explosion in modal mucalculus model checking. 1 Introduction Model checking [CE81, QS82, CES86] is a verification technique aimed at determining whether a system specification possesses a property expressed as a temporal logic formula
A LinearTime ModelChecking Algorithm for the AlternationFree Modal MuCalculus
 Formal Methods in System Design
, 1993
"... We develop a modelchecking algorithm for a logic that permits propositions to be defined using greatest and least fixed points of mutually recursive systems of equations. This logic is as expressive as the alternationfree fragment of the modal mucalculus identified by Emerson and Lei, and it may ..."
Abstract

Cited by 134 (15 self)
 Add to MetaCart
We develop a modelchecking algorithm for a logic that permits propositions to be defined using greatest and least fixed points of mutually recursive systems of equations. This logic is as expressive as the alternationfree fragment of the modal mucalculus identified by Emerson and Lei, and it may
A Tableau Proof System with Names for Modal Mucalculus
"... Abstract Howard Barringer was a pioneer in the study of temporal logics with fixpoints ..."
Abstract
 Add to MetaCart
Abstract Howard Barringer was a pioneer in the study of temporal logics with fixpoints
Tableau Methods for Modal and Temporal Logics
, 1995
"... This document is a complete draft of a chapter by Rajeev Gor'e on "Tableau Methods for Modal and Temporal Logics" which is part of the "Handbook of Tableau Methods", edited by M. D'Agostino, D. Gabbay, R. Hahnle and J. Posegga, to be published in 1998 by Kluwer, Dordrec ..."
Abstract

Cited by 152 (20 self)
 Add to MetaCart
, Dordrecht. Any comments and corrections are highly welcome. Please email me at rpg@arp.anu.edu.au The latest version of this document can be obtained via my WWW home page: http://arp.anu.edu.au/ Tableau Methods for Modal and Temporal Logics Rajeev Gor'e Contents 1 Introduction
Selective mucalculus: New Modal Operators for Proving Properties on Reduced Transition Systems
 In Proceedings of FORTE X/PSTV XVII '97. Chapman
, 1997
"... In model checking for temporal logic, the correctness of a (concurrent) system with respect to a desired behavior is verified by checking whether a structure that models the system satisfies a formula describing the behaviour. Most existing verification techniques, and in particular those defined fo ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
for concurrent calculi like as CCS, are based on a representation of the concurrent system by means of a labelled transition system. In this approach to verification, state explosion is one of the most serious problems. In this paper we present a new temporal logic, the selective mucalculus, with the property
Modal Logics and muCalculi: An Introduction
, 2001
"... We briefly survey the background and history of modal and temporal logics. We then concentrate on the modal mucalculus, a modal logic which subsumes most other commonly used logics. We provide an informal introduction, followed by a summary of the main theoretical issues. We then look at modelchec ..."
Abstract

Cited by 62 (3 self)
 Add to MetaCart
We briefly survey the background and history of modal and temporal logics. We then concentrate on the modal mucalculus, a modal logic which subsumes most other commonly used logics. We provide an informal introduction, followed by a summary of the main theoretical issues. We then look at model
Results 1  10
of
140