Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

FM
2001
Springer

favoriteEmaildiscussreport

142views Formal Methods» more FM 2001»

Model-Checking over Multi-valued Logics

13 years 9 months ago

Model-Checking over Multi-valued Logics

Download www.cs.toronto.edu

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 quasi-boolean multi-valued logics for reasoning about such systems. We also give semantics to a multi-valued extension of CTL, describe an implementation of a symbolic multi-valued CTL model-checker called ¢ chek, and analyze its correctness and running time.

Marsha Chechik, Steve M. Easterbrook, Victor Petro

Real-time Traffic

FM 2001 | Formal Methods | Multi-valued | Quasi-boolean Multi-valued Logics | Symbolic Multi-valued Ctl |

claim paper

Related Content

» MultiValued Model Checking via Classical Model Checking

» A Framework for MultiValued Reasoning over Inconsistent Viewpoints

» CTL ModelChecking over Logics with NonClassical Negations

» Pushdown Model Checking for Malware Detection

» Model checking memoryful lineartime logics over onecounter automata

» The Bedwyr System for Model Checking over Syntactic Expressions

» Model Checking FOR over OneCounter Processes and beyond

» Lazy Theorem Proving for Bounded Model Checking over Infinite Domains

» Model Checking LTL over Controllable Linear Systems Is Decidable

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	FM
Authors	Marsha Chechik, Steve M. Easterbrook, Victor Petrovykh

Comments (0)