Extended Full Computation-tree Logics For Paraconsistent Model Checking

Logic and Logical Philosophy 15:251-267 (2006)
  Copy   BIBTEX

Abstract

It is known that the full computation-tree logic CTL∗is an important base logic for model checking. The bisimulation theorem for CTL∗is known to be useful for abstraction in model checking. In this paper, thebisimulation theorems for two paraconsistent four-valued extensions 4CTL∗and 4LCTL∗of CTL∗are shown, and a translation from 4CTL∗into CTL∗ispresented. By using 4CTL∗and 4LCTL∗, inconsistency-tolerant and spatiotemporal reasoning can be expressed as a model checking framework.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,440

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Extended full computation-tree logics for paraconsistent model checking.Norihiro Kamide - 2007 - Logic and Logical Philosophy 15 (3):251-276.
Model checking techniqes for the analysis of reactive systems.Stephan Merz - 2002 - Synthese 133 (1-2):173 - 201.
Symbolic model checking of logics with actions.Charles Pecheur & Franco Raimondi - 2007 - In A. Lomuscio & S. Edelkamp (eds.), Model Checking and Artificial Intelligence. Springer. pp. 113--128.
Model checking lattices: using and reasoning about information orders for abstraction.S. Hazelhurst & C. Seger - 1999 - Logic Journal of the IGPL 7 (3):375-411.
Reachability logic: an efficient fragment of transitive closure logic.N. Alechina & N. Immerman - 2000 - Logic Journal of the IGPL 8 (3):325-337.
Distributed extended beam search for quantitative model checking.Anton J. Wijs & Bert Lisser - 2007 - In A. Lomuscio & S. Edelkamp (eds.), Model Checking and Artificial Intelligence. Springer. pp. 166--184.
Bisimulation, modal logic and model checking games.C. Stirling - 1999 - Logic Journal of the IGPL 7 (1):103-124.
Model checking for hybrid logic.Martin Lange - 2009 - Journal of Logic, Language and Information 18 (4):465-491.
Checking EMTLK Properties of Timed Interpreted Systems Via Bounded Model Checking.Bożena Woźna-Szcześniak & Andrzej Zbrzezny - 2016 - Studia Logica 104 (4):641-678.
Polyadic dynamic logics for hpsg parsing.Anders Søgaard & Martin Lange - 2009 - Journal of Logic, Language and Information 18 (2):159-198.
An alternative approach for Quasi-Truth.Marcelo E. Coniglio & Luiz H. Da Cruz Silvestrini - 2014 - Logic Journal of the IGPL 22 (2):387-410.
Timed Modal Logics for Real-Time Systems: Specification, Verification and Control.Patricia Bouyer, Franck Cassez & François Laroussinie - 2011 - Journal of Logic, Language and Information 20 (2):169-203.
A framework for model checking institutions.Francesco Vigano - 2007 - In A. Lomuscio & S. Edelkamp (eds.), Model Checking and Artificial Intelligence. Springer. pp. 129--145.
The complexity of first-order and monadic second-order logic revisited.Markus Frick & Martin Grohe - 2004 - Annals of Pure and Applied Logic 130 (1-3):3-31.
A Symbolic Model Checking Framework for Safety Analysis, Diagnosis, and Synthesis.Piergiorgio Bertoli, Marco Bozzano & Alessandro Cimatti - 2007 - In A. Lomuscio & S. Edelkamp (eds.), Model Checking and Artificial Intelligence. Springer. pp. 1--18.

Analytics

Added to PP
2017-02-17

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references