A maximal entropy stochastic process for a timed automaton

DOI10.1016/j.ic.2014.12.006zbMath1327.68149MaRDI QIDQ2347798

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

stochastic process; timed automata; maximal entropy

Mathematics Subject Classification ID

68Q45: Formal languages and automata

60G05: Foundations of stochastic processes

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

Related Items

Unnamed Item, Timed Symbolic Dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Formal modeling and analysis of timed systems. 9th international conference, FORMATS 2011, Aalborg, Denmark, September 21--23, 2011. Proceedings
• A sandwich proof of the Shannon-McMillan-Breiman theorem
• A theory of timed automata
• Dynamical properties of timed automata
• Spectral Gap in Timed Automata
• Generating Functions of Timed Languages
• A Survey of Alternating Permutations
• Statistical Model Checking for Networks of Priced Timed Automata
• Thin and Thick Timed Regular Languages
• Volume and Entropy of Regular Timed Languages: Discretization Approach
• Symbolic Analysis for GSMP Models with One Stateful Clock
• Volume and Entropy of Regular Timed Languages: Analytic Approach
• Toward a Timed Theory of Channel Coding
• Introduction to Dynamical Systems
• An Introduction to Symbolic Dynamics and Coding
• As Soon as Probable: Optimal Scheduling under Stochastic Uncertainty
• A Maximal Entropy Stochastic Process for a Timed Automaton,
• Intrinsic Markov Chains
• Counting and Generating Permutations Using Timed Languages
• Probabilistic and Topological Semantics for Timed Automata
• Elements of Information Theory
• Tools and Algorithms for the Construction and Analysis of Systems