scientific article; zbMATH DE number 7378564

DOI10.4230/LIPIcs.CONCUR.2018.20MaRDI QIDQ5009434

Stefan Kiefer, Radu Grigore

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1806.06143

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Markov chainsautomatalanguage equivalenceprobabilistic systemsruntime monitoring

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Runtime monitors for Markov decision processes, A survey of challenges for runtime verification from advanced application domains (beyond software)

Uses Software

• Gurobi
• Deeplearning4j
• RxJava
• Infer

Cites Work

• Unnamed Item
• Unnamed Item
• Monitoring networks through multiparty session types
• On NFAs where all states are final, initial, or both
• Maximum-likelihood estimation for hidden Markov models
• Accurate Approximate Diagnosability of Stochastic Systems
• Automata theory in nominal sets
• Semantics and Algorithms for Parametric Monitoring
• LTL with the freeze quantifier and register automata
• Forward Bisimulations for Nondeterministic Symbolic Finite Automata
• A polynomial algorithm for testing diagnosability of discrete-event systems
• Diagnosability of discrete-event systems
• Diagnosability of stochastic discrete-event systems
• Compositional Shape Analysis by Means of Bi-Abduction