Results 1  10
of
16
An adequate logic for Full LOTOS
 FORMAL METHODS EUROPE'01, LNCS 2021
, 2001
"... We present a novel result for a logic for symbolic transition systems based on LOTOS processes. The logic is adequate with respect to bisimulation de ned on symbolic transition systems. ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
We present a novel result for a logic for symbolic transition systems based on LOTOS processes. The logic is adequate with respect to bisimulation de ned on symbolic transition systems.
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 14 (7 self)
 Add to MetaCart
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.
Modelchecking processes with data
 In Science of Computer Programming
, 2005
"... We propose a procedure for automatically verifying properties (expressed in an extension of the modal µcalculus) over processes with data, specified in µCRL. We first briefly review existing work, such as the theory of µCRL and we discuss the logic, called first order modal µcalculus in more detai ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
We propose a procedure for automatically verifying properties (expressed in an extension of the modal µcalculus) over processes with data, specified in µCRL. We first briefly review existing work, such as the theory of µCRL and we discuss the logic, called first order modal µcalculus in more detail. Then, we introduce the formalism of first order boolean equation systems and focus on several lemmata that are at the basis of the soundness of our decision procedure. We discuss our findings on three nontrivial applications for a prototype implementation of this procedure. The results show that our prototype can deal with quite complex and interesting properties and systems, showing the efficacy of the approach.
Equivalence checking for infinite systems using parameterized boolean equation systems
 In Proc. CONCUR’07, LNCS 4703
, 2007
"... Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, dataintensive systems in linear process format, into solving Parameterized Boolean Equation Systems. We prove correctness and illustrate the approach with two examples. We also pro ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, dataintensive systems in linear process format, into solving Parameterized Boolean Equation Systems. We prove correctness and illustrate the approach with two examples. We also provide small adaptations to obtain similar transformations for strong and weak bisimulations and simulation equivalences. 1
A Checker For Modal Formulas For Processes With Data
 Proceedings of FMCO 2003, volume 3188 of LNCS
, 2002
"... We propose an algorithm for the automatic verification of firstorder modal calculus formulae on infinite state, datadependent processes. The use of boolean equation systems for solving the modelchecking problem in the finite case is wellstudied. In this paper, we extend on this solution, such th ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We propose an algorithm for the automatic verification of firstorder modal calculus formulae on infinite state, datadependent processes. The use of boolean equation systems for solving the modelchecking problem in the finite case is wellstudied. In this paper, we extend on this solution, such that we can deal with infinite state, datadependent processes. We provide a transformation from the model checking problem to first order boolean equation systems. Moreover, we present an algorithm to solve these equation systems and discuss the capabilities of the algorithm, implemented in a prototype. We also present the application of our prototype tool to several wellknown infinite state processes from the literature. This prototype has also been successfully applied in proving properties of systems that we could not deal with using other available tools.
A linear processalgebraic format for probabilistic systems with data
"... Abstract—This paper presents a novel linear processalgebraic format for probabilistic automata. The key ingredient is a symbolic transformation of probabilistic process algebra terms that incorporate data into this linear format while preserving strong probabilistic bisimulation. This generalises si ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract—This paper presents a novel linear processalgebraic format for probabilistic automata. The key ingredient is a symbolic transformation of probabilistic process algebra terms that incorporate data into this linear format while preserving strong probabilistic bisimulation. This generalises similar techniques for traditional process algebras with data, and — more importantly — treats data and datadependent probabilistic choice in a fully symbolic manner, paving the way to the symbolic analysis of parameterised probabilistic systems. Keywordsprobabilistic process algebra, linearisation, datadependent probabilistic choice, symbolic transformations I.
A linear processalgebraic format with data for probabilistic automata
, 2011
"... This paper presents a novel linear processalgebraic format for probabilistic automata. The key ingredient is a symbolic transformation of probabilistic process algebra terms that incorporate data into this linear format while preserving strong probabilistic bisimulation. This generalises similar te ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This paper presents a novel linear processalgebraic format for probabilistic automata. The key ingredient is a symbolic transformation of probabilistic process algebra terms that incorporate data into this linear format while preserving strong probabilistic bisimulation. This generalises similar techniques for traditional process algebras with data, and — more importantly — treats data and datadependent probabilistic choice in a fully symbolic manner, leading to the symbolic analysis of parameterised probabilistic systems. We discuss several reduction techniques that can easily be applied to our models. A validation of our approach on two benchmark leader election protocols shows reductions of more than an order of magnitude.
The mCRL2 toolset
"... We describe the toolset for the behavioural specification language mCRL2. The purpose of the toolset is to analyse abstract models that describe the communication behaviour of software based systems. With the help of the toolset we want to efficiently detect and prevent problems in software, prefera ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We describe the toolset for the behavioural specification language mCRL2. The purpose of the toolset is to analyse abstract models that describe the communication behaviour of software based systems. With the help of the toolset we want to efficiently detect and prevent problems in software, preferably before it is built. The tools allow to transform specifications, generate and visualise state spaces, verify modal properties, and much more. In order to facilitate reuse of the code most of the functionality is included in libraries. This makes the toolset suitable as a platform for third party tool development and for other specification languages as well. The toolset is distributed under the Boost license, which permits such use.
Tutorial and Reference Guide for the µCRL toolset version 1.0
 ACP: Algebra of Communicating Processes, Workshops in Computing
, 1999
"... This document provide sufficient material to use the algebraic process description language CRL and the tools in the toolset (version 1.0). First an explanation for the data and process part of CRL is given. The Linear Process Operator (LPO) format, around which the toolset is constructed is provi ..."
Abstract
 Add to MetaCart
This document provide sufficient material to use the algebraic process description language CRL and the tools in the toolset (version 1.0). First an explanation for the data and process part of CRL is given. The Linear Process Operator (LPO) format, around which the toolset is constructed is provided. Extensive descriptions of the tools for CRL are given. These are a static semantic checker and compiler to LPO format (mcrl), a state space generator (instantiator), a pretty printer for LPOs (pp), and several tools to manipulate and optimize LPOs (rewr, parelm and constelm). Finally, it is explained how tools operating on LPOs can be constructed. 1991 Mathematics Subject Classification: 6801, 68N99 1991 Computing Reviews Classification System: D2.1, D.2.2, D.2.4 Keywords and Phrases: CRL, Abstract Data Types, Process Algebra, Tools, Linear Process Operator 1 Introduction The CRLToolkit is a collection of tools for manipulating process and data descriptions written in CRL (mi...
Verification and Testing Report
"... Introduction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2. Verification of Navigation System using the CRL Toolset. . . . . . . . . . . . . . . 4 2.1. Description of the CRL. . . . . . . . . . . . . . . . . . . . . . . . ..."
Abstract
 Add to MetaCart
Introduction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2. Verification of Navigation System using the CRL Toolset. . . . . . . . . . . . . . . 4 2.1. Description of the CRL. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2. CRL Toolset. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.3. Method of Verification. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.4. Application to the Case Study. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3. Logical verification of Navigation System using DYANA Toolset . . . . . . . . 10 3.1. MMSpec language and logical properties of NS behaviour. . . . . . . . . 11 3.1.1. Distributed program model. . . . . . . . . . . . . . . . . . . .