Results 1  10
of
28
A Framework for MultiValued Reasoning over Inconsistent Viewpoints
, 2001
"... In requirements elicitation, different stakeholders often hold different views of how a proposed system should behave, resulting in inconsistencies between their descriptions. Consensus may not be needed for every detail, but it can be hard to determine whether a particular disagreement affects the ..."
Abstract

Cited by 78 (27 self)
 Add to MetaCart
(Show Context)
In requirements elicitation, different stakeholders often hold different views of how a proposed system should behave, resulting in inconsistencies between their descriptions. Consensus may not be needed for every detail, but it can be hard to determine whether a particular disagreement affects the critical properties of the system. In this paper, we describe the # bel framework for merging and reasoning about multiple, inconsistent state machine models. # bel permits the analyst to choose how to combine information from the multiple viewpoints, where each viewpoint is described using an underlying multivalued logic. The different values of our logics typically represent different levels of agreement. Our multivalued model checker, # chek, allows us to check the merged model against properties expressed in a temporal logic. The resulting framework can be used as an exploration tool to support requirements negotiation, by determining what properties are preserved for various combinations of inconsistent viewpoints.
MultiValued Symbolic ModelChecking
 ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY
, 2003
"... This paper introduces the concept and the general theory of multivalued model checking, and describes a multivalued symbolic modelchecker \Chi Chek. Multivalued ..."
Abstract

Cited by 54 (17 self)
 Add to MetaCart
This paper introduces the concept and the general theory of multivalued model checking, and describes a multivalued symbolic modelchecker \Chi Chek. Multivalued
ModelChecking Over MultiValued Logics
 In Proceedings of FME’01
, 2001
"... Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when information is gathered from multiple sources). In this paper we propose the use of quasiboolean multivalued logics f ..."
Abstract

Cited by 32 (16 self)
 Add to MetaCart
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when information is gathered from multiple sources). In this paper we propose the use of quasiboolean multivalued logics for reasoning about such systems. We also give semantics to a multivalued extension of CTL, describe an implementation of a symbolic multivalued CTL modelchecker called chek, and analyze its correctness and running time.
Implementing a MultiValued Symbolic Model Checker
 In Proceedings of TACAS’01
, 2001
"... Multivalued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dynamic properties of systems where complete, agreed upon models of the system are not available. In this paper, we present ..."
Abstract

Cited by 25 (11 self)
 Add to MetaCart
Multivalued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dynamic properties of systems where complete, agreed upon models of the system are not available. In this paper, we present an implementation of a symbolic model checker for multivalued temporal logics. The model checker works for any multivalued logic whose truth values form a quasiboolean lattice. Our models are generalized Kripke structures, where both atomic propositions and transitions between states may take any of the truth values of a given multivalued logic. Properties to be model checked are expressed in CTL, generalized with a multivalued semantics. The design of the model checker is based on the use of MDDs, a multivalued extension of Binary Decision Diagrams. We describe MDDs and their use in the model checker. We also give its theoretical time complexity and some preliminary empirical performance data.
Efficient MultipleValued ModelChecking Using Lattice Representations
 In Proc. 12th Int. Conf. on Concurrency Theory (CONCUR’01), volume 2154 of LNCS, pp 451–465
, 2001
"... . Multiplevalued logics can be effectively used to reason about incomplete and/or inconsistent systems, e.g. during early software requirements or as the systems evolve. We specify multiplevalued logics using finite lattices. In this paper, we use lattice representation theory to cast the multi ..."
Abstract

Cited by 16 (11 self)
 Add to MetaCart
(Show Context)
. Multiplevalued logics can be effectively used to reason about incomplete and/or inconsistent systems, e.g. during early software requirements or as the systems evolve. We specify multiplevalued logics using finite lattices. In this paper, we use lattice representation theory to cast the multiplevalued modelchecking problem in terms of symbolic operations on classical sets of states, provided the lattices are distributive. This allows us to partially reuse existing symbolic modelchecking technology and improve efficiency over previous implementations that were based on multiplevalued decision diagrams. 1
Model checking with multivalued logics
, 2003
"... Abstract. In multivalued model checking, a temporal logic formula is interpreted relative to a structure not as a truth value but as a lattice element. In this paper we present new algorithms for multivalued model checking. We first show how to reduce multivalued model checking with any distribut ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
(Show Context)
Abstract. In multivalued model checking, a temporal logic formula is interpreted relative to a structure not as a truth value but as a lattice element. In this paper we present new algorithms for multivalued model checking. We first show how to reduce multivalued model checking with any distributive DeMorgan lattice to standard, twovalued model checking. We then present a direct, automatatheoretic algorithm for multivalued model checking with logics as expressive as the modal mucalculus. As part of showing correctness of the algorithm, we present a new fundamental result about extended alternating automata, a generalization of standard alternating automata. 1
Model Checking with MultiValued Temporal Logics
 In Proceedings of the International Symposium on Multiple Valued Logics
, 2000
"... Multivalued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dynamic properties of systems even where complete, agreed upon models of the system are not available. In this paper, we pre ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
(Show Context)
Multivalued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dynamic properties of systems even where complete, agreed upon models of the system are not available. In this paper, we present a symbolic model checker for multivalued temporal logics. The model checker works for any multivalued logic whose truth values form a quasiboolean lattice. Our models are generalized Kripke structures, where both atomic propositions and transitions between states may take any of the truth values of a given multivalued logic. Properties to be model checked are expressed in CTL, generalized with a multivalued semantics. The design of the model checker is based on the use of MDDs, a multivalued extension of Binary Decision Diagrams.
MultiValued Symbolic ModelChecking: Fairness, CounterExamples, Running Time
, 2003
"... Multivalued modelchecking is an effective technique for reasoning about systems with incomplete or inconsistent information. In particular, it is well suited for reasoning about abstract, partial, and featurebased system descriptions. The technique is based on extending the classical modelchec ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
Multivalued modelchecking is an effective technique for reasoning about systems with incomplete or inconsistent information. In particular, it is well suited for reasoning about abstract, partial, and featurebased system descriptions. The technique is based on extending the classical modelchecking algorithm over twovalued logic to arbitrary finite logics whose truth values form a distributive De Morgan lattice. In this thesis we address several issues surrounding the usability of multivalued modelchecking. Firstly, we provide an improved analysis of the worstcase complexity of the symbolic multivalued modelchecking algorithm, and show that it is independent of the height of the lattice. Secondly, we extend the notion of fairness to a multivalued models, thus enabling application of multivalued modelchecking to asynchronous concurrent systems. Thirdly, we introduce multivalued witnesses and counterexamples that aid in interpreting the results of the modelchecker. Finally, we describe the design and implementation of a multivalued modelchecker χChek.
Reasoning About Compositions of Concerns
, 2001
"... In this paper we propose a framework for defining and reasoning about compositions of concerns, based on multivalued logics. Rather than providing a small set of builtin composition operations, our framework provides a mechanism for constructing arbitrary types of composition. Our multivalued logi ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
In this paper we propose a framework for defining and reasoning about compositions of concerns, based on multivalued logics. Rather than providing a small set of builtin composition operations, our framework provides a mechanism for constructing arbitrary types of composition. Our multivalued logic model checker, # chek allows us to reason about the properties of compositions of concerns.
CTL ModelChecking over Logics with NonClassical Negations
 PROC. OF 33RD IEEE INT. SYMP. ON MULTIVALUED LOGICS (ISMVL’03
, 2003
"... In earlier work [9], we defined CTL modelchecking over finitevalued logics with De Morgan negation. In this paper, we extend this work to logics with intuitionistic, Galois and minimal negations, calling the resulting language CTL. We define CTL operators and show that they can be computed using ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
In earlier work [9], we defined CTL modelchecking over finitevalued logics with De Morgan negation. In this paper, we extend this work to logics with intuitionistic, Galois and minimal negations, calling the resulting language CTL. We define CTL operators and show that they can be computed using fixpoints. We further discuss how to extend our existing multivalued modelchecker Chek [8] to reasoning over these logics.