Results 1 
5 of
5
Parameterised Boolean Equation Systems
 In Theoretical Computer Science
, 2004
"... Boolean equation system are a useful tool for verifying formulas from modal mucalculus on transition systems (see [18] 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 ..."
Abstract

Cited by 21 (9 self)
 Add to MetaCart
(Show Context)
Boolean equation system are a useful tool for verifying formulas from modal mucalculus on transition systems (see [18] 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 [11, 15] it has been outlined how to transform a modal formula and a process, both containing data, to a socalled parameterised boolean equation system, or equation system for short. In this article we focus on techniques to solve such equation systems.
Fast Generic ModelChecking for DataBased Systems
 FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS  FORTE 2005, VOLUME 3731 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2005
"... This paper shows how predicate equation systems (PESs) may be used to solve modelchecking problems for systems, such as those involving realtime or value passing, that manipulate data. PESs are first defined and the encoding of modelchecking problems described; then generic global and local appr ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
This paper shows how predicate equation systems (PESs) may be used to solve modelchecking problems for systems, such as those involving realtime or value passing, that manipulate data. PESs are first defined and the encoding of modelchecking problems described; then generic global and local approaches for solving PESs are given. Realtime model checking is then considered in detail, and a new, efficient onthefly technique for realtime model checking based on proof search in PESs is developed and experimentally shown to significantly outperform existing approaches when system specifications or formula specifications contain errors and to be competitive when both are correct.
unknown title
, 2004
"... Abstract This note contains the contribution to the Concurrency Column of the EATCS Bulletin of February, 2004. It indicates on the one hand what the strengths of process algebras are, and on the other hand mentions a major shortcoming. Using elementary process algebra it is hard to prove correctne ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract This note contains the contribution to the Concurrency Column of the EATCS Bulletin of February, 2004. It indicates on the one hand what the strengths of process algebras are, and on the other hand mentions a major shortcoming. Using elementary process algebra it is hard to prove correctness of complex distributed algorithms, protocols and systems. We encountered this when providing a process algebraic proof that the sliding window protocol of buffer size n is behaviourally equivalent to a bounded queue of size 2n. We used and developed notions such as invariants, cones and foci and coordinate transformations together providing the means to give a precise and insightful proof of the correctness of the sliding window protocol. These and other techniques are all shortly addressed in this note. The main message however is that in order to make process algebra the universal tool for the study of correct system behaviour (for which we believe it is one of the best candidates) much more of effective proof techniques need to be developed. Why is process algebra exciting? An early paper by Milner in 1973 [41] gave a clear motivation for process algebra. He gave three reasons to design a process algebra.
3. Principle investigator: dr.ir. T.A.C. Willemse.
"... Model checking is a popular technique for verifying the designs of reallife systems, including realtime systems, hybrid systems, probabilistic systems and datadependent systems. Unfortunately, the results underlying the techniques from such specialised areas can be hard to translate to other area ..."
Abstract
 Add to MetaCart
(Show Context)
Model checking is a popular technique for verifying the designs of reallife systems, including realtime systems, hybrid systems, probabilistic systems and datadependent systems. Unfortunately, the results underlying the techniques from such specialised areas can be hard to translate to other areas because they rely on particular models. Moreover, systems cannot be classified as e.g. strictly realtime or strictly datadependent: in many cases, a system is in the intersection of various classes. While properties can be verified in their separate domains using dedicated techniques, verifying the behaviour in the intersection of various domains is often impossible with the currently available techniques. We propose to address these issues by studying the existing approaches in one framework: Parameterised Boolean Equation Systems (PBESs). Work by Mateescu, Groote and Mateescu, and Groote and Willemse has shown that the model checking problem for datadependent systems can be translated to solving PBESs. We propose to extend these results to realtime systems, and embed results from these specialist areas in the PBESs approach. Apart from the advantages that are brought about by studying known results in a single framework, PBESs offer a novel, and sometimes unique view on the model checking problem. For instance, Groote and Willemse showed that certain verification problems can be transformed to easier problems, simply by determining the syntactic form of the PBES and looking up its solution. While such techniques are commonplace in mathematics (e.g. for differentiation of functions), they are unique to the field of model checking and deserve further investigations.
The Concurrency Column
"... in organizing a thematic research workshop, a strategic meeting charting new research agenda or an advanced school on a theme related to concurrency theory to consider the University Residential Centre of Bertinoro, Bertinoro (Forl), Italy, as a possible location for it. Activities taking place in ..."
Abstract
 Add to MetaCart
(Show Context)
in organizing a thematic research workshop, a strategic meeting charting new research agenda or an advanced school on a theme related to concurrency theory to consider the University Residential Centre of Bertinoro, Bertinoro (Forl), Italy, as a possible location for it. Activities taking place in that beautiful conference location are held under the organization and sponsorship of BICI (Bertinoro International Center for Informatics). On behalf of the concurrency theory community, I welcome the establishment of such an association devoted to the development of research in Computer Science via the sponsorship of high quality events in an environment that offers excellent support, and a congenial atmosphere, for the hosting of research activities. P###### ####### ##### ##### ########### Wan Fokkink, Jan Friso Groote, Michel Reniers Dep. of Mathematics and Computer Science, Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands CWI, P.O. Box 94079, 109