Parameterised Boolean equation systems
From MaRDI portal
Recommendations
- CONCUR 2004 - Concurrency Theory
- Instantiation for Parameterised Boolean Equation Systems
- On systems of Boolean equations
- Invariants for parameterised Boolean equation systems
- Proof graphs for parameterised Boolean equation systems
- Structural analysis of Boolean equation systems
- Invariants for Parameterised Boolean Equation Systems
- Static Analysis Techniques for Parameterised Boolean Equation Systems
- Analyzing Boolean functions via solving parametric polynomial systems
- scientific article; zbMATH DE number 3316008
Cites work
- Algebraic process verification.
- CONCUR 2004 - Concurrency Theory
- Efficient local correctness checking for single and alternating boolean equation systems
- scientific article; zbMATH DE number 1696764 (Why is no real title available?)
- scientific article; zbMATH DE number 52748 (Why is no real title available?)
- scientific article; zbMATH DE number 1303726 (Why is no real title available?)
- scientific article; zbMATH DE number 1088043 (Why is no real title available?)
- scientific article; zbMATH DE number 1903346 (Why is no real title available?)
- Modal logics and mu-calculi: An introduction
- Model-checking processes with data
- Results on the propositional \(\mu\)-calculus
Cited in
(30)- Exponential automatic amortized resource analysis
- Proof graphs for parameterised Boolean equation systems
- Consistent consequence for Boolean equation systems
- Structural analysis of Boolean equation systems
- A comparison of BDD-based parity game solvers
- Liveness analysis for parameterised Boolean equation systems
- Using SMT for solving fragments of parameterised Boolean equation systems
- Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
- Invariants for Parameterised Boolean Equation Systems
- Consistent correlations for parameterised Boolean equation systems with applications in correctness proofs for manipulations
- Static Analysis Techniques for Parameterised Boolean Equation Systems
- scientific article; zbMATH DE number 1956574 (Why is no real title available?)
- scientific article; zbMATH DE number 2085280 (Why is no real title available?)
- scientific article; zbMATH DE number 7269247 (Why is no real title available?)
- Analysis of Boolean equation systems through structure graphs
- Fold/unfold transformations for fixpoint logic
- Partial-order reduction for parity games with an application on parameterised Boolean equation systems
- Abstraction in fixpoint logic
- CONCUR 2004 - Concurrency Theory
- Theoretical Aspects of Computing – ICTAC 2005
- A linear translation from CTL^* to the first-order modal -calculus
- Instantiation for Parameterised Boolean Equation Systems
- On-the-fly solving for symbolic parity games
- Operations on fixpoint equation systems
- Simplifying process parameters by unfolding algebraic data types
- Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
- Real equation systems with alternating fixed-points
- Unfolding state variables improves model checking performance
- Verification of reactive systems via instantiation of parameterised Boolean equation systems
- Invariants for parameterised Boolean equation systems
This page was built for publication: Parameterised Boolean equation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571204)