Polytime model checking for times probabilistic computation tree logic

DOI10.1007/S002360050136zbMath0910.68201OpenAlexW1999733611MaRDI QIDQ1127817

Danièle Beauquier, Anatol Slissenko

Publication date: 29 March 1999

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050136

zbMATH Keywords

model checkingprobabilistic transition systemspolytime algorithmtimed probabilistic computation tree logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Parallel algorithms in computer science (68W10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

A survey on temporal logics for specifying and verifying real-time systems ⋮ Model checking for a class of weighted automata

This page was built for publication: Polytime model checking for times probabilistic computation tree logic