Satisfiability degree analysis for transition system

Authors:
Yang Zhao;Guiming Luo
Affiliations:
School of Software, Tsinghua University, Beijing, China;School of Software, Tsinghua University, Beijing, China
Venue:
AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part I
Year:
2010

Citing 7
Cited 0

Symmetry breaking in distributed networks

Information and Computation
Model checking

Model checking
Logic in Computer Science: Modelling and Reasoning about Systems

Logic in Computer Science: Modelling and Reasoning about Systems
Backtracking Search Algorithm for Satisfiability Degree Calculation

FSKD '09 Proceedings of the 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02
Computation of Satisfiability Degree Based on CNF

FSKD '09 Proceedings of the 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 06
An Algorithm for Calculating the Satisfiability Degree

FSKD '09 Proceedings of the 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 07
DFS algorithm with ranking based on genetic algorithm in UHF portable system

ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Classical model checking is not capable of solving the situation of uncertain systems or fault-tolerant systems which occur in the real world commonly. The technique of satisfiability degree (SD) for model checking is a efficient way to solve this problem. Finite paths transition system (FPTS) for calculating satisfiability degree of a LTL logic formula is given. Then, a more general situation about discrete-time Markov chains (DTMCs) is discussed. Then a case named leader election shows the practicability of satisfiability degree for transition system, which cannot be solved by classical model checking.