Results 1  10
of
778,722
Model checking and the Mucalculus
 DIMACS Series in Discrete Mathematics
, 1997
"... There is a growing recognition of the need to apply formal mathematical methods in the design of "high confidence" computing systems. Such systems operate in safety critical contexts (e.g., air traffic control systems) or where errors could have major adverse economic consequences (e.g., ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
attention on a particularly important type of temporal logic known as the Mucalculus.
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 753 (40 self)
 Add to MetaCart
Binary Decision Diagrams (Bryant, R. E., 1986, IEEE Trans. Comput. C35) to represent relations and formulas. We then show how our new MuCalculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satistiability of lineartime temporal logic formulas
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 734 (21 self)
 Add to MetaCart
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional
Abstract Mucalculus path checking
"... We investigate the path model checking problem for the µcalculus. Surprisingly, restricting to deterministic structures does not allow for more efficient model checking algorithm, as we prove that it can encode any instance of the standard model checking problem for the µcalculus. 1 ..."
Abstract
 Add to MetaCart
We investigate the path model checking problem for the µcalculus. Surprisingly, restricting to deterministic structures does not allow for more efficient model checking algorithm, as we prove that it can encode any instance of the standard model checking problem for the µcalculus. 1
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
Debt, deficits and finite horizons
 Journal of Political Economy
, 1985
"... Weitzman have improved this paper. I thank NSF for financial ..."
Abstract

Cited by 579 (1 self)
 Add to MetaCart
Weitzman have improved this paper. I thank NSF for financial
Games and Modal MuCalculus
 In Second International Workshop Tools and Algorithms for Construction and Analysis of Systems
, 1996
"... We define EhrenfeuchtFraiss'e games which exactly capture the expressive power of the extremal fixed point operators of modal mucalculus. The resulting games have significance, we believe, within and outside of concurrency theory. On the one hand they naturally extend the iterative bisimul ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
explores the technical contribution that games can make to understanding concurrency. We define EhrenfeuchtFraiss'e games which exactly capture the expressive power of the extremal fixed point operators of modal mucalculus. The resulting games have significance, we believe, within and outside
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 138 (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
The Horn Mucalculus
, 1998
"... The Horn calculus is a logic programming language allowing arbitrary nesting of least and greatest fixed points. The Horn programs can naturally expresses safety and liveness properties for reactive systems. We extend the setbased analysis of classical logic programs by mapping arbitrary program ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
The Horn calculus is a logic programming language allowing arbitrary nesting of least and greatest fixed points. The Horn programs can naturally expresses safety and liveness properties for reactive systems. We extend the setbased analysis of classical logic programs by mapping arbitrary
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
Results 1  10
of
778,722