Temporal Logics and Model Checking for Fairly Correct Systems

Authors:
Daniele Varacca;Hagen Volzer
Affiliations:
Imperial College London, UK;Universität zu Lübeck, Germany
Venue:
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Year:
2006

Citing 0
Cited 6

On fairness and randomness

Information and Computation
Counterexamples in Probabilistic LTL Model Checking for Markov Chains

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Probabilistic and topological semantics for timed automata

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Model checking almost all paths can be less expensive than checking all paths

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Fair adversaries and randomization in two-player games

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Defining Fairness in Reactive and Concurrent Systems

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The UCLID project seeks to develop formal verification tools for infinite-state systems having a degree of automation comparable to that of model checking tools for finitestate systems. The UCLID modeling language describes systems where the state variables ...