On the public citation graph
Simple linear-time algorithms for minimal fixed points
0 signed · 96 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-11494-7_22openalex-snapshot
Specification and verification of concurrent systems in CESAR
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/3-540-56496-9_4openalex-snapshot
Efficient local correctness checking
inferredcites →https://doi.org/10.1007/3-540-58201-0_77openalex-snapshot
Efficient local correctness checking for single and alternating boolean equation systems
inferredcites →https://doi.org/10.1007/3-540-61474-5_61openalex-snapshot
HORNSAT, model checking, verification and games
inferredcites →https://doi.org/10.1007/978-3-540-69850-0_12openalex-snapshot
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
inferredcites →https://doi.org/10.1007/bf00264284openalex-snapshot
Tableau-based model checking in the propositional mu-calculus
inferredcites →https://doi.org/10.1007/bf01383878openalex-snapshot
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1007/bfb0026106openalex-snapshot
Proof systems for Hennessy-Milner Logic with recursion
inferredcites →https://doi.org/10.1007/bfb0054161openalex-snapshot
Fully local and efficient evaluation of alternating fixed points
inferredcites →https://doi.org/10.1016/0020-0190(88)90029-4openalex-snapshot
A linear algorithm to solve fixed-point equations on transition systems
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/0304-3975(94)90266-6openalex-snapshot
Model checking and boolean graphs
inferredcites →https://doi.org/10.1016/0743-1066(84)90014-1openalex-snapshot
Linear-time algorithms for testing the satisfiability of propositional horn formulae
inferredcites →https://doi.org/10.1109/lics.1996.561358openalex-snapshot
Efficient model checking via the equational μ-calculus
inferredcites →https://doi.org/10.1109/sfcs.1981.4openalex-snapshot
A decidable mu-calculus: Preliminary report
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.25405/ncl.34123050openalex-snapshot
Formal Methods: State of the Art and Future Directions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118558188.ch6openalex-snapshot
Tools for Model‐Checking Timed Systems
inferred← citeshttps://doi.org/10.1007/11415763_9openalex-snapshot
Solving Alternating Boolean Equation Systems in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/11539452_9openalex-snapshot
Efficient On-the-Fly Algorithms for the Analysis of Timed Games
inferred← citeshttps://doi.org/10.1007/11691617_8openalex-snapshot
Distributed On-the-Fly Model Checking and Test Case Generation
inferred← citeshttps://doi.org/10.1007/3-540-45446-2_20openalex-snapshot
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_18openalex-snapshot
Efficient Diagnostic Generation for Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-01090-4_13openalex-snapshot
A Symbolic Algorithm for Lazy Synthesis of Eager Strategies
inferred← citeshttps://doi.org/10.1007/978-3-030-11245-5_25openalex-snapshot
A Parallel Relation-Based Algorithm for Symbolic Bisimulation Minimization
inferred← citeshttps://doi.org/10.1007/978-3-030-17462-0_18openalex-snapshot
Abstract Dependency Graphs and Their Application to Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-20652-9_20openalex-snapshot
Symbolic Model Checking of Weighted PCTL Using Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-30923-7_1openalex-snapshot
Model Verification Through Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-51831-8_3openalex-snapshot
Synthesis for Multi-weighted Games with Branching-Time Winning Conditions
inferred← citeshttps://doi.org/10.1007/978-3-030-51831-8_6openalex-snapshot
On-the-Fly Synthesis for Strictly Alternating Games
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-031-22337-2_21openalex-snapshot
Convex Lattice Equation Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-32157-3_9openalex-snapshot
Elimination of Detached Regions in Dependency Graph Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-66149-5_5openalex-snapshot
Two Decades of Industrializing Formal Verification: The Reactis Story
inferred← citeshttps://doi.org/10.1007/978-3-031-66676-6_9openalex-snapshot
Consistent Alignments for Simple Ontologies in the Digital Information Supply Chain
inferred← citeshttps://doi.org/10.1007/978-3-031-90643-5_11openalex-snapshot
Token Elimination in Model Checking of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_33openalex-snapshot
CAAL: Concurrency Workbench, Aalborg Edition
inferred← citeshttps://doi.org/10.1007/978-3-319-32582-8_9openalex-snapshot
Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_18openalex-snapshot
A New Approach to Checking the Dynamic Consistency of Conditional Simple Temporal Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-47677-3_13openalex-snapshot
Distributed Computation of Fixed Points on Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-57861-3_10openalex-snapshot
Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-65765-3_9openalex-snapshot
Symbolic Dependency Graphs for $$\text {PCTL}^{>}_{\le }$$ Model-Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-99154-2_5openalex-snapshot
On the Verification of Weighted Kripke Structures Under Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_3openalex-snapshot
Efficient On-the-Fly Algorithms for Partially Observable Timed Games
inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_15openalex-snapshot
Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-03240-0_18openalex-snapshot
Using Datalog and Boolean Equation Systems for Program Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-04617-9_1openalex-snapshot
Solving Fully-Observable Non-deterministic Planning Problems via Translation into a General Game
inferred← citeshttps://doi.org/10.1007/978-3-642-24206-9_1openalex-snapshot
Datalog-Based Program Analysis with BES and RWL
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_15openalex-snapshot
A Hierarchical Approach for the Synthesis of Stabilizing Controllers for Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39176-7_12openalex-snapshot
Local Model Checking of Weighted CTL with Upper-Bound Constraints
inferred← citeshttps://doi.org/10.1007/978-3-662-73305-9_11openalex-snapshot
A Gentle Tour Through A Petri Net Model Checking Tool
inferred← citeshttps://doi.org/10.1007/s00236-019-00344-8openalex-snapshot
A symbolic algorithm for lazy synthesis of eager strategies
inferred← citeshttps://doi.org/10.1007/s00446-014-0227-2openalex-snapshot
The complexity of automated addition of fault-tolerance without explicit legitimate states
inferred← citeshttps://doi.org/10.1007/s00453-012-9729-0openalex-snapshot
On the Complexity of Strongly Connected Components in Directed Hypergraphs
inferred← citeshttps://doi.org/10.1007/s10009-005-0194-9openalex-snapshot
CAESAR_SOLVE: A generic library for on-the-fly resolution of alternation-free Boolean equation systems
inferred← citeshttps://doi.org/10.1007/s10009-012-0244-zopenalex-snapshot
CADP 2011: a toolbox for the construction and analysis of distributed processes
inferred← citeshttps://doi.org/10.1007/s10009-014-0359-5openalex-snapshot
Efficient model-checking of weighted CTL with upper-bound constraints
inferred← citeshttps://doi.org/10.1007/s10009-016-0414-5openalex-snapshot
Preface of the special issue on Model Checking of Software
inferred← citeshttps://doi.org/10.1007/s10009-017-0473-2openalex-snapshot
Discrete and continuous strategies for timed-arc Petri net games
inferred← citeshttps://doi.org/10.1007/s10009-020-00578-9openalex-snapshot
Dependency graphs with applications to verification
inferred← citeshttps://doi.org/10.1007/s10009-021-00638-8openalex-snapshot
Extended abstract dependency graphs
inferred← citeshttps://doi.org/10.1007/s10703-011-0115-3openalex-snapshot
Antichains and compositional algorithms for LTL synthesis
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.109768openalex-snapshot
Formal controller synthesis from specifications given by discrete-time hybrid automata
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.08.064openalex-snapshot
Obtaining Memory-Efficient Solutions to Boolean Equation Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.110openalex-snapshot
A Game-theoretic Approach to Behavioural Visualisation
inferred← citeshttps://doi.org/10.1016/j.jda.2003.12.005openalex-snapshot
Partially dynamic maintenance of minimum weight hyperpaths
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.02.001openalex-snapshot
Model checking and synthesis for branching multi-weighted logics
inferred← citeshttps://doi.org/10.1016/j.scico.2019.102321openalex-snapshot
Parallel parameter synthesis algorithm for hybrid CTL
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.03.016openalex-snapshot
Directed hypergraphs: Introduction and fundamental algorithms—A survey
inferred← citeshttps://doi.org/10.1101/2020.11.16.381566openalex-snapshot
Community Detection in a Weighted Directed Hypergraph Representation of Cell-to-cell Communication Networks
inferred← citeshttps://doi.org/10.1109/cmc.2010.11openalex-snapshot
A Vehicle Weigh-in-Motion System Based on Hopfield Neural Network Adaptive Filter
inferred← citeshttps://doi.org/10.1109/date.2008.4484728openalex-snapshot
A Game-Theoretic Approach to Real-Time System Testing
inferred← citeshttps://doi.org/10.1109/empdp.2005.19openalex-snapshot
Distributed Local Resolution of Boolean Equation Systems
inferred← citeshttps://doi.org/10.1109/time.2009.14openalex-snapshot
Simple Algorithm for Simple Timed Games
inferred← citeshttps://doi.org/10.1145/1403375.1403491openalex-snapshot
A game-theoretic approach to real-time system testing
inferred← citeshttps://doi.org/10.1145/2071368.2071376openalex-snapshot
Structural Analysis of Boolean Equation Systems
inferred← citeshttps://doi.org/10.1145/2791060.2791111openalex-snapshot
All-at-once-synthesis of controllers from scenario-based product line specifications
inferred← citeshttps://doi.org/10.1145/3501300openalex-snapshot
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics
inferred← citeshttps://doi.org/10.1145/3672608.3707768openalex-snapshot
Towards Solidity Smart Contract Efficiency Optimization through Code Mining
inferred← citeshttps://doi.org/10.1145/3749101openalex-snapshot
An On-the-Fly Synthesis Framework for LTL over Finite Traces
inferred← citeshttps://doi.org/10.4204/eptcs.390.7openalex-snapshot
CGAAL: Distributed On-The-Fly ATL Model Checker with Heuristics
inferred← citeshttps://doi.org/10.4230/oasics.syncop.2015.48openalex-snapshot
Game-based Synthesis of Distributed Controllers for Sampled Switched Systems
inferred← citeshttps://doi.org/10.4230/oasics.syncop.2015.77openalex-snapshot
Parametric Verification of Weighted Systems
inferred← citeshttps://doi.org/10.48550/arxiv.2305.10546openalex-snapshot
Games on Graphs: From Logic and Automata to Algorithms
inferred← citeshttps://doi.org/10.54337/aau510736584openalex-snapshot
Abstract Dependency Graphs for Model Verification
inferred← citeshttps://doi.org/10.54337/aau779529764openalex-snapshot
Safe, Optimal and Compact Strategies for Cyber Physical Systems
inferred← citeshttps://doi.org/10.6100/ir757862openalex-snapshot
Advanced reduction techniques for model checking
inferred← citeshttps://doi.org/10.70675/20a401fczec5bz423fza963z0e6ff98980e8openalex-snapshot
Approches formelles de la planification du partage de plusieurs ressources
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.