Efficient local correctness checking for single and alternating boolean equation systems

DOI10.1007/3-540-58201-0_77zbMath1422.68174OpenAlexW2169232561MaRDI QIDQ4632435

No author found.

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_77

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Partial-order reduction in the weak modal mu-calculus ⋮ Efficient local correctness checking for single and alternating boolean equation systems ⋮ CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks ⋮ Parameterised Boolean equation systems

Cites Work

• Unnamed Item
• A linear algorithm to solve fixed-point equations on transition systems
• Tableau-based model checking in the propositional mu-calculus
• A linear-time model-checking algorithm for the alternation-free modal mu- calculus
• A lattice-theoretical fixpoint theorem and its applications
• Branching time and abstraction in bisimulation semantics
• Efficient local correctness checking for single and alternating boolean equation systems

This page was built for publication: Efficient local correctness checking for single and alternating boolean equation systems