Computation tree logic for synchronization properties

DOI10.4230/LIPICS.ICALP.2016.98zbMATH Open1388.68184arXiv1604.06384MaRDI QIDQ4598239FDOQ4598239

Krishnendu Chatterjee, Laurent Doyen

Publication date: 19 December 2017

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

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

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)

Cited In (2)

• The complexity of synchronizing Markov decision processes
• 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)