SAT-based Learning of Computation Tree Logic

Adrien Pommellet, Daniel Stan, Simon Scatton

The CTL learning problem consists in finding for a given sample of positive and negative Kripke structures a distinguishing CTL formula that is verified by the former but not by th…