Operations on fixpoint equation systems
From MaRDI portal
Publication:6597955
DOI10.46298/lmcs-20(3:5)2024MaRDI QIDQ6597955
Publication date: 4 September 2024
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Verification of reactive systems via instantiation of parameterised Boolean equation systems
- Programming languages and their definition. Selected papers ed. by C. B. Jones
- Invariants for parameterised Boolean equation systems
- Fixed point theorems and semantics: A folk tale
- Model checking and boolean graphs
- Fast and simple nested fixpoints
- Algebraic and coalgebraic methods in the mathematics of program construction. International summer school and workshop, Oxford, GB, April 10--14, 2000. Revised lectures
- Energy parity games
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- Efficient on-the-fly model-checking for regular alternation-free \(\mu\)-calculus
- Quasipolynomial computation of nested fixpoints
- Model-checking processes with data
- Parameterised Boolean equation systems
- A lattice-theoretical fixpoint theorem and its applications
- Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
- A Brief Overview of PVS
- Solving Parity Games in Practice
- Deciding parity games in quasipolynomial time
- Fold/Unfold Transformations for Fixpoint Logic
- Tools and Algorithms for the Construction and Analysis of Systems
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Abstract Dependency Graphs and Their Application to Model Checking
- Universal algorithms for parity games and nested fixpoints
- Temporal verification of programs via first-order fixpoint logic
This page was built for publication: Operations on fixpoint equation systems
