A maximal entropy stochastic process for a timed automaton

DOI10.1016/J.IC.2014.12.006MaRDI QIDQ2347798zbMATH OpenOpenAlexFDO

Authors Nicolas Basset

Publication date 9 June 2015

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2014.12.006

zbMATH Keywords

maximal entropystochastic processtimed automata

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
• On probabilistic timed automata.
• scientific article; zbMATH DE number 5997233
• Entropy of regular timed languages

Cites work

• A Mathematical Theory of Communication
• A Maximal Entropy Stochastic Process for a Timed Automaton,
• A sandwich proof of the Shannon-McMillan-Breiman theorem
• A survey of alternating permutations
• A theory of timed automata
• An Introduction to Symbolic Dynamics and Coding
• As soon as probable: optimal scheduling under stochastic uncertainty
• Counting and Generating Permutations Using Timed Languages
• Dynamical properties of timed automata
• Elements of Information Theory
• Formal modeling and analysis of timed systems. 9th international conference, FORMATS 2011, Aalborg, Denmark, September 21--23, 2011. Proceedings
• Generating Functions of Timed Languages
• scientific article; zbMATH DE number 5988004 (Why is no real title available?)
• scientific article; zbMATH DE number 42531 (Why is no real title available?)
• scientific article; zbMATH DE number 176728 (Why is no real title available?)
• scientific article; zbMATH DE number 1321178 (Why is no real title available?)
• scientific article; zbMATH DE number 2183071 (Why is no real title available?)
• scientific article; zbMATH DE number 3202900 (Why is no real title available?)
• Intrinsic Markov Chains
• Introduction to Dynamical Systems
• Probabilistic and Topological Semantics for Timed Automata
• Spectral gap in timed automata
• Statistical Model Checking for Networks of Priced Timed Automata
• Symbolic Analysis for GSMP Models with One Stateful Clock
• Thin and thick timed regular languages
• Tools and Algorithms for the Construction and Analysis of Systems
• Toward a timed theory of channel coding
• Volume and entropy of regular timed languages: analytic approach
• Volume and Entropy of Regular Timed Languages: Discretization Approach

Cited in

(6)

• Timed symbolic dynamics
• Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraints
• Maximum entropy for determining the transition probability matrix of a Markov chain with a specified stationary distribution
• A Maximal Entropy Stochastic Process for a Timed Automaton,
• Max-entropy sampling for deterministic timed automata under linear duration constraints
• Direct sampling of confined polygons in linear time

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