A formalisation of consistent consequence for Boolean equation systems
From MaRDI portal
Recommendations
- Consistent consequence for Boolean equation systems
- Proof by consistency in conditional equational theories
- Consistent correlations for parameterised Boolean equation systems with applications in correctness proofs for manipulations
- CONCUR 2004 - Concurrency Theory
- scientific article; zbMATH DE number 432735
- A Boolean computation approach of formal concepts
- Theory and Applications of Satisfiability Testing
- scientific article; zbMATH DE number 7204433
- Proof graphs for parameterised Boolean equation systems
- Publication:4487297
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- Abstraction in fixpoint logic
- An overview of the mCRL2 toolset and its recent advances
- Compositional verification of asynchronous concurrent systems using CADP
- Consistent consequence for Boolean equation systems
- Consistent correlations for parameterised Boolean equation systems with applications in correctness proofs for manipulations
- Introduction to bisimulation and coinduction
- Liveness analysis for parameterised Boolean equation systems
Cited in
(4)
This page was built for publication: A formalisation of consistent consequence for Boolean equation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687766)