scientific article; zbMATH DE number 7559481
From MaRDI portal
Publication:5089290
DOI10.4230/LIPIcs.CONCUR.2020.25MaRDI QIDQ5089290
Tommaso Padoan, Barbara König, Paolo Baldan
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2003.08877
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
\(\mu\)-calculuscomplete latticesparity gamesabstract interpretationbisimilarityup-to techniquesfixpoint equation systems
Related Items (3)
Fixpoint Theory -- Upside Down ⋮ Up-to techniques for behavioural metrics via fibrations ⋮ Fixpoint theory -- upside down
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Results on the propositional \(\mu\)-calculus
- Constructive versions of Tarski's fixed point theorems
- Fast and simple nested fixpoints
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
- The power of parameterization in coinductive proof
- Checking NFA equivalence with bisimulations up to congruence
- Model checking of probabilistic and nondeterministic systems
- Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation
- Introduction to Bisimulation and Coinduction
- The mu-calculus and Model Checking
- Complete Lattices and Up-To Techniques
- Łukasiewicz μ-calculus
- Coinduction All the Way Up
- Deciding parity games in quasipolynomial time
- Up-To Techniques for Behavioural Metrics via Fibrations
- Sound up-to techniques and Complete abstract domains
- A modal μ perspective on solving parity games in quasi-polynomial time
- Temporal abstract interpretation
- Barbed bisimulation
- Results on the quantitative μ-calculus qM μ
- Making abstract interpretations complete
- Enhancements of the bisimulation proof method
This page was built for publication:
