A Maximal Entropy Stochastic Process for a Timed Automaton,

DOI10.1007/978-3-642-39212-2_9MaRDI QIDQ5327423zbMATH OpenOpenAlexFDO

Authors Nicolas Basset

Publication date 7 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39212-2_9

Mathematics Subject Classification ID

Foundations of stochastic processes (60G05) Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• A maximal entropy stochastic process for a timed automaton
• Stochastic timed automata
• scientific article; zbMATH DE number 1569133
• Strict Divergence for Probabilistic Timed Automata
• Measuring performance of continuous-time stochastic processes using timed automata
• Probability timed automata for investigating communication processes
• scientific article; zbMATH DE number 5997233
• Expressiveness and conciseness of timed automata for the verification of stochastic models

Cited in

(6)

• Entropy of regular timed languages
• A maximal entropy stochastic process for a timed automaton
• Spectral gap in timed automata
• Timed symbolic dynamics
• Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraints
• Max-entropy sampling for deterministic timed automata under linear duration constraints

This page was built for publication: A Maximal Entropy Stochastic Process for a Timed Automaton,

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