Real equation systems with alternating fixed-points

DOI10.4230/LIPICS.CONCUR.2023.28MaRDI QIDQ6967318zbMATH OpenFDO

Authors Jan Friso Groote, T. A. C. Willemse

Publication date 26 June 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2023.28

zbMATH Keywords

Gauss-eliminationmodel checkingquantitative modal mu-calculusreal equation systemsolution method

Mathematics Subject Classification ID

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

Cites work

• A linear translation from CTL^* to the first-order modal -calculus
• A probabilistic analysis of the Game of the Goose
• Deciding parity games in quasipolynomial time
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Model-checking processes with data
• Modeling and analysis of communicating systems
• On the use of model and logical embeddings for model checking of probabilistic systems
• Parameterised Boolean equation systems
• Precise Fixpoint Computation Through Strategy Iteration
• Principles of systems design. Essays dedicated to Thomas A. Henzinger on the occasion of his 60th birthday
• Problem solving using process algebra considered insightful
• Solving Łukasiewicz \(\mu\)-terms
• Succinct progress measures for solving parity games
• The mu-calculus and Model Checking
• Zielonka's recursive algorithm: dull, weak and solitaire games and tighter bounds
• Łukasiewicz \(\mu\)-calculus

This page was built for publication: Real equation systems with alternating fixed-points

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