On probabilistic timed automata.
type: Item
instance of: scholarly article
title: On probabilistic timed automata.
zbMATH Open document ID: 1064.68063
DOI: 10.1016/S0304-3975(01)00215-8
author: Danièle Beauquier
published in: Theoretical Computer Science
publication date: 2003-01-22T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1857211
zbMATH Keywords: Model-checking
zbMATH Keywords: Markov decision process
zbMATH Keywords: Probabilistic timed automata
MaRDI profile type: Publication
cites work: A theory of timed automata
cites work: Rational \(\omega\)-languages are non-ambiguous
cites work: Model checking of probabilistic and nondeterministic systems
cites work: On the complexity of finite memory policies for Markov decision processes
cites work: The complexity of probabilistic verification
cites work: Markov decision processes and regular events
cites work: A logic for reasoning about time and reliability
cites work: Testing and generating infinite sequences by a finite automaton
cites work: The Complexity of Markov Decision Processes
cites work: Q3483104
full work available at URL: s0304-3975(01)00215-8
OpenAlex ID: W2009363597
description: scientific article; zbMATH DE number 1857211