External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Satisfiability Problem for a Quantitative Fragment of PCTL

Miroslav Chodil, Antonín Kucera 0001. The Satisfiability Problem for a Quantitative Fragment of PCTL. In Evripidis Bampis, Aris Pagourtzis, editors, Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings. Volume 12867 of Lecture Notes in Computer Science, pages 149-161, Springer, 2021. [doi]

Authors

Miroslav Chodil

This author has not been identified. Look up 'Miroslav Chodil' in Google

Antonín Kucera 0001

This author has not been identified. Look up 'Antonín Kucera 0001' in Google
runs on