scientific article; zbMATH DE number 7559481

DOI10.4230/LIPICS.CONCUR.2020.25MaRDI QIDQ5089290zbMATH OpenFDO

Authors Paolo Baldan, Barbara König, Tommaso Padoan

Publication date 18 July 2022

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

zbMATH Keywords

abstract interpretationcomplete latticesparity gamesbisimilarityup-to techniques\(\mu\)-calculusfixpoint equation systems

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• scientific article; zbMATH DE number 1759702 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
• Barbed bisimulation
• Checking NFA equivalence with bisimulations up to congruence
• Coinduction All the Way Up
• Complete Lattices and Up-To Techniques
• Constraint-based abstract semantics for temporal logic: a direct approach to design and implementation
• Constructive versions of Tarski's fixed point theorems
• Deciding parity games in quasipolynomial time
• Enhancements of the bisimulation proof method
• Fast and simple nested fixpoints
• Introduction to bisimulation and coinduction
• Making abstract interpretations complete
• Model checking of probabilistic and nondeterministic systems
• Precongruences and parametrized coinduction for logics for behavioral equivalence
• Results on the propositional \(\mu\)-calculus
• Results on the quantitative \(\mu\)-calculus \(qM\mu\)
• Sound up-to techniques and complete abstract domains
• Succinct progress measures for solving parity games
• Temporal abstract interpretation
• The mu-calculus and Model Checking
• The power of parameterization in coinductive proof
• Up-to techniques for behavioural metrics via fibrations
• When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
• Łukasiewicz \(\mu\)-calculus

Cited in

(5)

• Fixpoint Theory -- Upside Down
• Operations on fixpoint equation systems
• Fixpoint theory -- upside down
• Up-to techniques for behavioural metrics via fibrations
• Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089290)