Verifying temporal properties of systems
Verifying temporal properties of systems
Modal and temporal properties of processes
Modal and temporal properties of processes
Local Model Checking for Value-Passing Processes (Extended Abstract)
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Modal µ-Calculus, Model Checking and Gauß Elimination
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Invariants in Process Algebra with Data
CONCUR '94 Proceedings of the Concurrency Theory
The Power of QDDs (Extended Abstract)
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Definable Operation in General Algebras, and the Theory of Automata and Flowcharts
Programming Languages and Their Definition - Hans Bekic (1936-1982)
Model-checking processes with data
Science of Computer Programming
Equational binary decision diagrams
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
A Model Checking Language for Concurrent Value-Passing Systems
FM '08 Proceedings of the 15th international symposium on Formal Methods
Instantiation for Parameterised Boolean Equation Systems
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Invariants for Parameterised Boolean Equation Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Static Analysis Techniques for Parameterised Boolean Equation Systems
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Formal Aspects in Security and Trust
Invariants for Parameterised Boolean Equation Systems
Theoretical Computer Science
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Experiences in developing the mCRL2 toolset
Software—Practice & Experience
Bisimulation minimisations for boolean equation systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Automated translation and analysis of a ToolBus script for auctions
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Consistent consequence for boolean equation systems
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Equivalence checking for infinite systems using parameterized Boolean equation systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
An overview of the mCRL2 toolset and its recent advances
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
Boolean equation system are a useful tool for verifying formulas from modal µ-calculus on transition systems (see [Mader, Lecture Notes in Computer Science, Vol. 1019, 1995, pp. 72-88] for an excellent treatment). We are interested in an extension of boolean equation systems with data. This allows to formulate and prove a substantially wider range of properties on much larger and even infinite state systems. In previous works [Groote and Mateescu, Lecture Notes in Computer Science, Vol. 1548, 1999, pp. 74-90; Groote and Willemse, Sci. Comput. Program., 2005] it has been outlined how to transform a modal formula and a process, both containing data, to a so-called parameterised boolean equation system, or equation system for short. In this article we focus on techniques to solve such equation systems.We introduce a new equivalence between equation systems, because existing equivalences are not compositional. We present techniques similar to Gauß elimination as outlined in [Mader, Lecture Notes in Computer Science, Vol. 1019, 1995, pp. 72-88] that allow to solve each equation system provided a single equation can be solved. We give several techniques for solving single equations, such as approximation (known), patterns (new) and invariants (new). Finally, we provide several small but illustrative examples of verifications of modal µ-calculus formulas on concrete processes to show the use of the techniques.