Polytime model checking for times probabilistic computation tree logic

DOI10.1007/S002360050136MaRDI QIDQ1127817zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A decidable probability logic for timed probabilistic systems
• On probabilistic timed automata.
• Model checking of probabilistic and nondeterministic systems
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Model Checking Probabilistic Timed Automata with One or Two Clocks

Cited in

(4)

• A survey on temporal logics for specifying and verifying real-time systems
• scientific article; zbMATH DE number 7280017 (Why is no real title available?)
• Probabilistic and prioritized models of timed CSP
• Model checking for a class of weighted automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127817)