Counting CTL

DOI10.2168/LMCS-9(1:3)2013zbMath1260.68233OpenAlexW3037249291MaRDI QIDQ4913765

Antoine Meyer, François Laroussinie, Eudes Petonnet

Publication date: 9 April 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-9(1:3)2013

zbMATH Keywords

complexitycountingsatisfiabilityconstraintsbranching time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (1)

Pebble Weighted Automata and Weighted Logics

Uses Software

• CESAR

This page was built for publication: Counting CTL