On the public citation graph
Fixpoint games on continuous lattices
0 signed · 60 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-15648-8_7openalex-snapshot
Automata, tableaux, and temporal logics
inferredcites →https://doi.org/10.1007/3-540-46419-0_29openalex-snapshot
Symbolic Representation of Upward-Closed Sets
inferredcites →https://doi.org/10.1007/3-540-46541-3_24openalex-snapshot
Small Progress Measures for Solving Parity Games
inferredcites →https://doi.org/10.1007/3-540-56496-9_32openalex-snapshot
Faster model checking for the modal Mu-Calculus
inferredcites →https://doi.org/10.1007/978-3-319-10575-8_26openalex-snapshot
The mu-calculus and Model Checking
inferredcites →https://doi.org/10.1007/978-3-319-73579-5_8openalex-snapshot
Parity Games and Automata for Game Logic
inferredcites →https://doi.org/10.1007/978-3-540-75596-8_23openalex-snapshot
Latticed Simulation Relations and Games
inferredcites →https://doi.org/10.1007/978-3-540-87531-4_12openalex-snapshot
Continuous Fragment of the mu-Calculus
inferredcites →https://doi.org/10.1007/978-3-662-03811-6openalex-snapshot
Principles of Program Analysis
inferredcites →https://doi.org/10.1007/978-3-662-10778-2openalex-snapshot
Verification of Reactive Systems
inferredcites →https://doi.org/10.1007/bf00264284openalex-snapshot
Tableau-based model checking in the propositional mu-calculus
inferredcites →https://doi.org/10.1007/bfb0054166openalex-snapshot
Practical model-checking using games
inferredcites →https://doi.org/10.1016/0020-0190(96)00130-5openalex-snapshot
Fast and simple nested fixpoints
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(90)90110-4openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1016/j.scico.2019.102320openalex-snapshot
Conditional transition systems with upgrades
inferredcites →https://doi.org/10.1016/j.tcs.2004.09.035openalex-snapshot
A behavioural pseudometric for probabilistic transition systems
inferredcites →https://doi.org/10.1016/s0304-3975(96)00228-9openalex-snapshot
An improved algorithm for the evaluation of fixpoint expressions
inferredcites →https://doi.org/10.1016/s0304-3975(98)00009-7openalex-snapshot
Infinite games on finitely coloured graphs with applications to automata on infinite trees
inferredcites →https://doi.org/10.1016/s1571-0661(05)80251-8openalex-snapshot
Automatically Proving Up–to Bisimulation
inferredcites →https://doi.org/10.1017/cbo9780511542725openalex-snapshot
Continuous Lattices and Domains
inferredcites →https://doi.org/10.1017/cbo9780511777110openalex-snapshot
Introduction to Bisimulation and Coinduction
inferredcites →https://doi.org/10.1017/cbo9780511792588openalex-snapshot
Advanced Topics in Bisimulation and Coinduction
inferredcites →https://doi.org/10.1017/cbo9780511792588.007openalex-snapshot
Enhancements of the bisimulation proof method
inferredcites →https://doi.org/10.1017/cbo9780511809088openalex-snapshot
Introduction to Lattices and Order
inferredcites →https://doi.org/10.1093/logcom/exq005openalex-snapshot
Notions of Bisimulation for Heyting-Valued Modal Languages
inferredcites →https://doi.org/10.1093/oso/9780198537809.001.0001openalex-snapshot
Handbook of Logic in Computer Science
inferredcites →https://doi.org/10.1109/lics.1997.614940openalex-snapshot
Quantitative analysis and model checking
inferredcites →https://doi.org/10.1109/sfcs.1991.185392openalex-snapshot
Tree automata, mu-calculus and determinacy
inferredcites →https://doi.org/10.1109/tase.2017.8285624openalex-snapshot
Conditional transition systems with upgrades
inferredcites →https://doi.org/10.1145/1182613.1182616openalex-snapshot
Results on the quantitative μ-calculus qM μ
inferredcites →https://doi.org/10.1145/1961204.1961207openalex-snapshot
Solving systems of rational equations through strategy iteration
inferredcites →https://doi.org/10.1145/2837614.2837673openalex-snapshot
Lattice-theoretic progress measures and coalgebraic model checking
inferredcites →https://doi.org/10.1145/3055399.3055409openalex-snapshot
Deciding parity games in quasipolynomial time
inferredcites →https://doi.org/10.1145/3209108.3209169openalex-snapshot
Sound up-to techniques and Complete abstract domains
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
inferredcites →https://doi.org/10.2140/pjm.1979.82.43openalex-snapshot
Constructive versions of Tarski’s fixed point theorems
inferredcites →https://doi.org/10.2168/lmcs-8(2:7)2012openalex-snapshot
On the equivalence of game and denotational semantics for the probabilistic mu-calculus
inferredcites →https://doi.org/10.48550/arxiv.1810.11404openalex-snapshot
Fixpoint Games on Continuous Lattices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_13openalex-snapshot
Verification of Multiplayer Stochastic Games via Abstract Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2_3openalex-snapshot
Quasipolynomial Computation of Nested Fixpoints
inferred← citeshttps://doi.org/10.1007/978-3-031-22337-2_12openalex-snapshot
Universal Algorithms for Parity Games and Nested Fixpoints
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9_2openalex-snapshot
Fair $$\omega $$-Regular Games
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9_4openalex-snapshot
Symbolic Solution of Emerson-Lei Games for Reactive Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-032-16855-9_5openalex-snapshot
Fixed-Point Reasoning for Stochastic Systems
inferred← citeshttps://doi.org/10.1007/s00354-022-00186-yopenalex-snapshot
Codensity Games for Bisimilarity
inferred← citeshttps://doi.org/10.1109/formalise.2019.00009openalex-snapshot
Static Analysis for Worst-Case Battery Utilization
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00048openalex-snapshot
Conformance Games for Graded Semantics
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25ce9openalex-snapshot
Quasipolynomial Computation of Nested Fixpoints
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2022.44openalex-snapshot
A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.123openalex-snapshot
The Strahler Number of a Parity Game
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2022.43openalex-snapshot
One-To-Two-Player Lifting for Mildly Growing Memory
inferred← citeshttps://doi.org/10.46298/lmcs-20(3:9)2024openalex-snapshot
Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi
inferred← citeshttps://doi.org/10.54337/aau510736584openalex-snapshot
Abstract Dependency Graphs for Model Verification
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.