Polytime model checking for times probabilistic computation tree logic
From MaRDI portal
Publication:1127817
DOI10.1007/s002360050136zbMath0910.68201MaRDI 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
model checking; probabilistic transition systems; polytime algorithm; timed probabilistic computation tree logic
68T27: Logic in artificial intelligence
68W10: Parallel algorithms in computer science
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Model checking for a class of weighted automata, A survey on temporal logics for specifying and verifying real-time systems