Computation tree logic for synchronization properties

DOI10.4230/LIPICS.ICALP.2016.98MaRDI QIDQ4598239zbMATH OpenFDO

Authors Krishnendu Chatterjee, Laurent Doyen

Publication date 19 December 2017

Full work available at URL https://arxiv.org/abs/1604.06384

zbMATH Keywords

complexitymodel checkingsynchronizationcomputation tree logic

Mathematics Subject Classification ID

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

Recommendations

• Quantified computation tree logic
• Extended computation tree logic
• Cycle detection in computation tree logic
• Distributed Computing - IWDC 2004
• scientific article; zbMATH DE number 7439738

Cited in

(4)

• Path logics with synchronization
• The complexity of synchronizing Markov decision processes
• Computation tree logic with deadlock detection
• Bounds for synchronizing Markov decision processes

This page was built for publication: Computation tree logic for synchronization properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598239)