Max-entropy sampling for deterministic timed automata under linear duration constraints

DOI10.1007/978-3-031-43835-6_14MaRDI QIDQ6546454zbMATH OpenFDO

Authors Benoît Barbot, Nicolas Basset

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43835-6_14

Mathematics Subject Classification ID

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,
• A maximal entropy stochastic process for a timed automaton
• Volume and entropy of regular timed languages: analytic approach
• Volume and Entropy of Regular Timed Languages: Discretization Approach
• Entropy of regular timed languages

Cites work

• A maximal entropy stochastic process for a timed automaton
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Counting and generating permutations in regular classes
• Entropy of regular timed languages
• Formal Methods for the Design of Real-Time Systems
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• Model checking for probabilistic timed automata
• Stochastic timed automata
• Uniform sampling for timed automata with application to language inclusion measurement

This page was built for publication: Max-entropy sampling for deterministic timed automata under linear duration constraints

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