scientific article; zbMATH DE number 6820287

DOI10.4230/LIPICS.ICALP.2016.98zbMath1388.68184arXiv1604.06384MaRDI QIDQ4598239

Krishnendu Chatterjee, Laurent Doyen

Publication date: 19 December 2017

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexitysynchronizationmodel checkingcomputation 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)

Related Items (2)

The complexity of synchronizing Markov decision processes ⋮ Bounds for synchronizing Markov decision processes

This page was built for publication: