Reducing model checking from multi-valued CTL^ to CTL^

DOI10.1007/3-540-45694-5_16MaRDI QIDQ4484490zbMATH OpenFDO

Authors Beata Konikowska, Wojciech Penczek

Publication date 12 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2421/24210226.htm

Mathematics Subject Classification ID

Temporal logic (03B44) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 2104629
• Reducing model checking of the many to the few
• Multi-valued model checking via classical model checking.
• On the Model Checking Problem for Some Extension of CTL*
• Efficient multiple-valued model-checking using lattice representations
• Implementing a multi-valued symbolic model checker
• scientific article; zbMATH DE number 2042616
• Model-checking over multi-valued logics
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Logic Programming

Cited in

(2)

• scientific article; zbMATH DE number 2042616 (Why is no real title available?)
• scientific article; zbMATH DE number 2104629 (Why is no real title available?)

This page was built for publication: Reducing model checking from multi-valued \(\text{CTL}^{\ast}\) to \(\text{CTL}^{\ast}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484490)