Efficient multiple-valued model-checking using lattice representations

DOI10.1007/3-540-44685-0_30MaRDI QIDQ4791849zbMATH OpenFDO

Authors Marsha Chechik, Benet Devereux, Steve Easterbrook, Albert Lai, Victor Petrovykh

Publication date 3 February 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/2154/21540441.htm

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Data structures for symbolic multi-valued model-checking
• Automata, Languages and Programming
• Implementing a multi-valued symbolic model checker
• Model-checking over multi-valued logics
• Multi-valued model checking via classical model checking.

Cited in

(10)

• Structures of compactly generated lattices described by cut sets of \(L\)-valued sets
• Model-checking over multi-valued logics
• A Direct Algorithm for Multi-valued Bounded Model Checking
• Model checking lattices: using and reasoning about information orders for abstraction
• scientific article; zbMATH DE number 1927565 (Why is no real title available?)
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Multi-valued logic for static analysis and model checking
• A priority-based negotiations approach for handling inconsistencies in multi-perspective software requirements
• Data structures for symbolic multi-valued model-checking
• On lattice valued up-sets and down-sets

This page was built for publication: Efficient multiple-valued model-checking using lattice representations

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