(Enter summary)
Abstract: A multi-valued version of CTL
(mv-CTL
), where both the
propositions and the accessibility relation are multi-valued taking values
in a finite quasi-Boolean algebra, is defined. A translation from mv-CTL
model checking to CTL
model checking is investigated. First, the case
where the elements of quasi-Boolean algebras are totally ordered is considered. (Update)
Cited by: More
Multi-Valued Model Checking via Classical Model - Checking Arie Gurfinkel
(Correct)
Similar documents (at the sentence level):
29.5%: Reducing Model Checking from Multi-Valued CTL - Konikowska, Penczek (2002)
(Correct)
Active bibliography (related documents): More All
0.5: On Designated Values in Multi-Valued CTL - Model Checking Konikowska (2003)
(Correct)
0.4: Bounded Model Checking for the Universal Fragment of CTL - Penczek, al. (2002)
(Correct)
0.4: Wojciech Penczek and Bo_zena Wozna - Bounded (2002)
(Correct)
Similar documents based on text: More All
0.4: Verification of Timed Automata Based on Similarity - Dembinski, Penczek, Polrola (2002)
(Correct)
0.4: Model Checking of Causal Knowledge Formulas - Penczek, Ambroszkiewicz (1999)
(Correct)
0.4: Verifying Epistemic Properties of Multi-agent Systems via.. - Penczek, al. (2003)
(Correct)
BibTeX entry: (Update)
B. Konikowska and W. Penczek. "Model Checking for Multi-Valued CTL*". In M. Fitting and E. Orlowska, editors, Multi-Valued Logics. 2002. (to appear). http://citeseer.ist.psu.edu/konikowska02model.html More
@misc{ konikowska02model,
author = "B. Konikowska and W. Penczek",
title = "Model Checking for Multi-Valued CTL",
text = "B. Konikowska and W. Penczek. Model Checking for Multi-Valued CTL*. In
M. Fitting and E. Orlowska, editors, Multi-Valued Logics. 2002. (to appear).",
year = "2002",
url = "citeseer.ist.psu.edu/konikowska02model.html" }
Citations (may not include all citations):
1726
Graph-based algorithms for boolean function manipulation
- Bryant - 1986
1097
Automatic verification of finite state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
828
Model Checking
- Clarke, Grumberg et al. - 1999
244
Symbolic model checking without BDDs
- Biere, Cimatti et al. - 1999
230
Checking that finite-state concurrent programs satisfy their.. (context) - Lichtenstein, Pnueli - 1984
127
An automata-theoretic approach to branching-time model check..
- Bernholtz, Vardi et al. - 1994
120
Handbook of Theoretical Computer Science (context) - Emerson - 1990
108
Symbolic model checking using SAT procedures instead of BDDs
- Biere, Cimatti et al. - 1999
86
Stubborn sets for reduced state space generation (context) - Valmari - 1989
53
Binary Decision Diagrams and beyond: Enabling technologies f..
- Bryant - 1995
43
Abstract interpretation of reactive systems: Abstractions pr.. (context) - Dams, Grumberg et al. - 1994
43
Formal Methods in System Design (context) - Emerson, Sistla et al. - 1995
34
Many-valued modal logics
- Fitting - 1991
29
Generalized model checking: reasoning about partial state sp..
- Bruns, Godefroid - 2000
28
Partial order reduction: Linear and branching temporal logic.. (context) - Peled - 1996
26
A framework for multi-valued reasoning over inconsistent vie..
- Easterbrook, Chechik - 2001
20
Many-valued modal logics II
- Fitting - 1992
15
Efficient multiple-valued model-checking using lattice repre..
- Chechik, Devereux et al. - 2001
14
Implementing a multi-valued symbolic model-checker
- Chechik, Devereux et al.
13
Model checking using adaptive state and data abstraction (context) - Dams, Gerth et al. - 1994
12
Compositional model checking of partially ordered state spac..
- Hazelhurst - 1996
8
Improving partial order reductions for universal branching t..
- Penczek, Szreter et al. - 2000
8
On interpreting results of model-checking with abstraction
- Chechik - 2000
8
Model checking infinite statespaces systems with fine-graine..
- Chechik, Devereux et al.
5
Towards bounded model checking for Timed Automata (context) - Penczek, Wo'zna - 2001
3
Model checking partial state spaces (context) - Bruns, Godefroid - 1999
2
Model checking over multivalued temporal logics (context) - Chechik, Easterbrook et al.
Documents on the same site (http://www.ipipan.waw.pl/~penczek/WPenczek/allpapers.html): More
Model Checking for Modal Logics (Extended Abstract) - Penczek (2001)
(Correct)
Towards Formal Specification and Verification in Cyberspace - Ambroszkiewicz, Penczek.. (2000)
(Correct)
A Complete Axiomatization of a First-Order Temporal Logic.. - Penczek, Srebrny (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC