The Satisfiability Problem for Probabilistic CTL

Authors:
Tomá Brázdil;Vojtech Forejt;Jan Kretínský;Antonín Kucera
Affiliations:
-;-;-;-
Venue:
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Year:
2008

Citing 0
Cited 3

p-Automata: New foundations for discrete-time probabilistic verification

Performance Evaluation
A temporal logic with mean-payoff constraints

ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
A survey on temporal logics for specifying and verifying real-time systems

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

Abstract