Weighted Timed MSO Logics
From MaRDI portal
Recommendations
Cites work
- A Kleene-Schützenberger Theorem for Weighted Timed Automata
- Automata, Languages and Programming
- Decision Problems of Finite Automata Design and Related Arithmetics
- Definable Transductions and Weighted Logics for Texts
- Event-clock automata: a determinizable class of timed automata
- Handbook of weighted automata
- scientific article; zbMATH DE number 1696511 (Why is no real title available?)
- scientific article; zbMATH DE number 1794367 (Why is no real title available?)
- scientific article; zbMATH DE number 1390065 (Why is no real title available?)
- Improved undecidability results on weighted timed automata
- Inference of Event-Recording Automata Using Timed Decision Trees
- On the optimal reachability problem of weighted timed automata
- Optimal paths in weighted timed automata
- Weighted automata and weighted logics
- Weighted Automata and Weighted Logics on Infinite Words
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Weighted Logics for Traces
- Weighted Picture Automata and Weighted Logics
- Weighted tree automata and weighted logics
Cited in
(10)- Weighted automata and weighted MSO logics for average and long-time behaviors
- Logics for weighted timed pushdown automata
- Kleene-Schützenberg and Büchi theorems for weighted timed automata.
- On the supports of recognizable timed series
- Weight monitoring with linear temporal logic
- A Nivat theorem for weighted timed automata and weighted relative distance logic
- MSO logics for weighted timed automata
- A Kleene-Schützenberger theorem for weighted timed automata
- A Büchi-like theorem for weighted tree automata over multioperator monoids
- Weighted automata and multi-valued logics over arbitrary bounded lattices
This page was built for publication: Weighted Timed MSO Logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637244)