Results 1  10
of
96
Efficient OntheFly ModelChecking for Regular AlternationFree MuCalculus
, 2000
"... Modelchecking is a successful technique for automatically verifying concurrent finitestate systems. When building a modelchecker, a good compromise must be made between the expressive power of the property description formalism, the complexity of the modelchecking problem, and the userfriendlin ..."
Abstract

Cited by 81 (17 self)
 Add to MetaCart
Modelchecking is a successful technique for automatically verifying concurrent finitestate systems. When building a modelchecker, a good compromise must be made between the expressive power of the property description formalism, the complexity of the modelchecking problem, and the userfriendliness of the interface. We present a temporal logic and an associated modelchecking method that attempt to fulfill these criteria. The logic is an extension of the alternationfree µcalculus with ACTLlike action formulas and PDLlike regular expressions, allowing a concise and intuitive description of safety, liveness, and fairness properties over labeled transition systems. The modelchecking method is based upon a succinct translation of the verification problem into a boolean equation system, which is solved by means of an efficient local algorithm having a good average complexity. The algorithm also allows to generate full diagnostic information (examples and counterexamples) for temporal for...
The Formal Specification Language mCRL2
 In Proceedings of the Dagstuhl Seminar
, 2007
"... Abstract. We introduce mCRL2, a specification language that can be used to specify and analyse the behaviour of distributed systems. This language is the successor of the µCRL specification language. The mCRL2 language extends a timed basic process algebra with the possibility to define and use abst ..."
Abstract

Cited by 47 (9 self)
 Add to MetaCart
(Show Context)
Abstract. We introduce mCRL2, a specification language that can be used to specify and analyse the behaviour of distributed systems. This language is the successor of the µCRL specification language. The mCRL2 language extends a timed basic process algebra with the possibility to define and use abstract data types. The mCRL2 data language features predefined and higherorder data types. The process algebraic part of mCRL2 allows a faithful translation of coloured Petri nets and component based systems: we have introduced multiactions and we have separated communication and parallelism.
µCRL: A toolset for analysing algebraic specifications
 Proc. 13th Conference on Computer Aided Verification, LNCS 2102
, 2001
"... µCRL [13] is a language for specifying and verifying distributed systems in an algebraic fashion. It targets the specification of system behaviour in a processalgebraic style and of data elements in the form of abstract data types. The µCRL toolset [21] (see ..."
Abstract

Cited by 39 (18 self)
 Add to MetaCart
µCRL [13] is a language for specifying and verifying distributed systems in an algebraic fashion. It targets the specification of system behaviour in a processalgebraic style and of data elements in the form of abstract data types. The µCRL toolset [21] (see
Typical structural properties of state spaces
 In Proc. of SPIN Workshop, volume 2989 of LNCS
, 2004
"... Abstract. Explicit model checking algorithms explore the full state space of a system. We have gathered a large collection of state spaces and performed an extensive study of their structural properties. The results show that state spaces have several typical properties and that they differ signific ..."
Abstract

Cited by 25 (7 self)
 Add to MetaCart
(Show Context)
Abstract. Explicit model checking algorithms explore the full state space of a system. We have gathered a large collection of state spaces and performed an extensive study of their structural properties. The results show that state spaces have several typical properties and that they differ significantly from both random graphs and regular graphs. We point out how to exploit these typical properties in practical model checking algorithms. 1
Analysis of a distributed system for lifting trucks
 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
, 2003
"... ..."
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 19 (8 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.
Towards a formal specification of an electronic payment system
 In WADT 2004, LNCS 3423
, 2005
"... Abstract. This paper describes the formal specification of a future banking system by abstract data types and process algebra. In contrast to previous exercises (e.g., [1]), the system’s description is an actual industrial standard which is being used to develop the next generation of automatic bank ..."
Abstract

Cited by 18 (13 self)
 Add to MetaCart
(Show Context)
Abstract. This paper describes the formal specification of a future banking system by abstract data types and process algebra. In contrast to previous exercises (e.g., [1]), the system’s description is an actual industrial standard which is being used to develop the next generation of automatic banking machines. The specification language CspCasl is particularly well suited to this type of problem, since it combines both control and data aspects and allows loose specification of data types for later refinement. During the formalisation, several inconsistencies and ambiguities were exhibited. The obtained specification serves as a starting point for further validation. 1
Computer Assisted Manipulation of Algebraic Process Specifications
, 2001
"... Specifications of system behaviour tend to become large. Analysis of such specifications requires automated tools. Most attention hitherto has been invested in fully automatic tools. We however believe that in many cases human intervention is required and we therefore propose a number of computer to ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
Specifications of system behaviour tend to become large. Analysis of such specifications requires automated tools. Most attention hitherto has been invested in fully automatic tools. We however believe that in many cases human intervention is required and we therefore propose a number of computer tools to transform process specifications. The concrete manipulation tools that we describe can eliminate constants, redundant sum variables and parameters, and allow to split variables ranging over complex datatypes. These tools can transform specifications with large finite state spaces to variants with state spaces being a fraction of their original size, and transform specifications with infinite state spaces to those with finite state spaces. 2000 Mathematics Subject Classification: 68M14, 68Q60, 68Q85 Keywords and Phrases: Automated Reasoning, Distributed systems, Linear Process Equations, Model Checking, Verification Note: Research carried out in SEN2, with financial support of the "Systems Validation Center". 1.
Formal Description and Analysis of a Bounded Retransmission Protocol
 UNIVERSITY OF MARIBOR
, 1996
"... This paper reports about the formal specification and verification of a Bounded Retransmission Protocol (Brp) used by Philips in one of its products. We started with the descriptions of the Brp service (i.e., external behaviour) and protocol written in the µCrl language by Groote and van de Pol. Aft ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
This paper reports about the formal specification and verification of a Bounded Retransmission Protocol (Brp) used by Philips in one of its products. We started with the descriptions of the Brp service (i.e., external behaviour) and protocol written in the µCrl language by Groote and van de Pol. After translating them in the Lotos language, we performed verifications by modelchecking using the Cadp (Caesar/Aldébaran) toolbox. The models of the Lotos descriptions were generated using the Caesar compiler (by putting bounds on the data domains) and checked to be branching equivalent using the Aldébaran tool. Alternately, we formulated in the Actl temporal logic a set of safety and liveness properties for the Brp protocol and checked them on the corresponding model using our Xtl generic modelchecker.