Efficient local correctness checking for single and alternating boolean equation systems

DOI10.1007/3-540-58201-0_77MaRDI QIDQ4632435zbMATH OpenOpenAlexFDO

Authors

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)

Cites work

• A lattice-theoretical fixpoint theorem and its applications
• A linear algorithm to solve fixed-point equations on transition systems
• A linear-time model-checking algorithm for the alternation-free modal mu- calculus
• Branching time and abstraction in bisimulation semantics
• Efficient local correctness checking for single and alternating boolean equation systems
• scientific article; zbMATH DE number 4131643 (Why is no real title available?)
• Tableau-based model checking in the propositional mu-calculus

Cited in

(4)

• Parameterised Boolean equation systems
• 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
• Partial-order reduction in the weak modal mu-calculus

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632435)