Logics for Weighted Timed Pushdown Automata
From MaRDI portal
Publication:2947171
DOI10.1007/978-3-319-23534-9_9zbMath1465.68142OpenAlexW2295146924MaRDI QIDQ2947171
Vitaly Perevoshchikov, Manfred Droste
Publication date: 22 September 2015
Published in: Fields of Logic and Computation II (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-23534-9_9
monadic second-order logictimed automataformal power seriesweighted automatapushdown automataweighted logictimed stack
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Higher-order logic (03B16)
Related Items (4)
Greibach normal form for \(\omega\)-algebraic systems and weighted simple \(\omega\)-pushdown automata ⋮ Weighted simple reset pushdown automata ⋮ A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties ⋮ Logic for \(\omega\)-pushdown automata
Cites Work
- Unnamed Item
- MSO logics for weighted timed automata
- Handbook of weighted automata
- Transductions des langages de Chomsky
- A theory of timed automata
- Pushdown timed automata: A binary reachability characterization and safety verification.
- Weighted automata and weighted logics
- Timed automata with observers under energy constraints
- Dense-Timed Pushdown Automata
- A Logical Characterization of Timed Pushdown Languages
- Weak Second‐Order Arithmetic and Finite Automata
- Visibly pushdown languages
- Weighted versus Probabilistic Logics
- Decision Problems of Finite Automata Design and Related Arithmetics
- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata
- Hybrid Systems: Computation and Control
This page was built for publication: Logics for Weighted Timed Pushdown Automata
