A maximal entropy stochastic process for a timed automaton
Mon, Jun 3, 2013 - Fri, Jun 7, 2013
Automata Theory and Symbolic Dynamics
Theoretical problem statement Lift the Shannon/Parry Markov chain of a strongly connected finite graph to the timed automata settings. (aka MME of an irreducible SFT) Practical problem statement Generate quickly and as uniformly as possible runs of a timed automaton. ◮ quickly: Step by step simulation as with a finite state Markov Chain → Stochastic Process Over Runs (SPOR) ◮ ≈ uniformly → SPOR of maximal entropy + asymptotic equipartition property.