A Weighted μ-Calculus on Words
From MaRDI portal
Publication:3637241
DOI10.1007/978-3-642-02737-6_31zbMath1247.03042MaRDI QIDQ3637241
Publication date: 7 July 2009
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_31
03B45: Modal logic (including the logic of norms)
03B70: Logic in computer science
03D05: Automata and formal grammars in connection with logical questions
68Q70: Algebraic theory of languages and automata
Related Items
Adding pebbles to weighted automata: easy specification \& efficient evaluation, Weighted versus Probabilistic Logics
Cites Work
- Results on the propositional \(\mu\)-calculus
- Handbook of weighted automata
- Skew and infinitary formal power series
- Weighted automata and weighted logics
- On the definition of a family of automata
- Weighted Automata and Weighted Logics on Infinite Words
- ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS
- Lattice Automata
- Automata, Languages and Programming
- CONCUR 2003 - Concurrency Theory
- Rudiments of \(\mu\)-calculus
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item