Results 1  10
of
31
A model checking language for concurrent valuepassing systems
 Proc. of FM’2008, LNCS
, 2008
"... Abstract. Modal µcalculus is an expressive specification formalism for temporal properties of concurrent programs represented as Labeled Transition Systems (Ltss). However, its practical use is hampered by the complexity of the formulas, which makes the specification task difficult and errorpron ..."
Abstract

Cited by 35 (7 self)
 Add to MetaCart
(Show Context)
Abstract. Modal µcalculus is an expressive specification formalism for temporal properties of concurrent programs represented as Labeled Transition Systems (Ltss). However, its practical use is hampered by the complexity of the formulas, which makes the specification task difficult and errorprone. In this paper, we propose Mcl (Model Checking Language), an enhancement of modal µcalculus with highlevel operators aimed at improving expressiveness and conciseness of formulas. The main Mcl ingredients are parameterized fixed points, action patterns extracting data values from Lts actions, modalities on transition sequences described using extended regular expressions and programming language constructs, and an infinite looping operator specifying fairness. We also present a method for onthefly model checking of Mcl formulas on finite Ltss, based on the local resolution of boolean equation systems, which has a lineartime complexity for alternationfree and fairness formulas. Mcl is supported by the Evaluator 4.0 model checker developed within the Cadp verification toolbox. 1
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.
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 18 (7 self)
 Add to MetaCart
(Show Context)
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.
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 14 (5 self)
 Add to MetaCart
(Show Context)
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 13 (9 self)
 Add to MetaCart
(Show Context)
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
Instantiation for parameterised boolean equation systems
 In Proceedings of ICTAC’08
, 2008
"... Abstract. Verification problems for finite and infinitestate processes, like model checking and equivalence checking, can effectively be encoded in Parameterised Boolean Equation Systems (PBESs). Solving the PBES solves the encoded problem. The decidability of solving a PBES depends on the data so ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Verification problems for finite and infinitestate processes, like model checking and equivalence checking, can effectively be encoded in Parameterised Boolean Equation Systems (PBESs). Solving the PBES solves the encoded problem. The decidability of solving a PBES depends on the data sorts that occur in the PBES. We describe a manipulation for transforming a given PBES to a simpler PBES that may admit solution methods that are not applicable to the original one. Depending on whether the data sorts occurring in the PBES are finite or countable, the resulting PBES can be a Boolean Equation System (BES) or an Infinite Boolean Equation System (IBES). Computing the solution to a BES is decidable. Computing the global solution to an IBES is still undecidable, but for partial solutions (which suffices for e.g. local model checking), effective tooling is possible. We give examples that illustrate the efficacy of our techniques. 1
Using mCRL2 for the analysis of software product lines
"... We show how the formal specification language mCRL2 and its stateoftheart toolset can be used successfully to model and analyze variability in software product lines. The mCRL2 toolset supports parametrized modeling, model reduction and quality assurance techniques like model checking. We present ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
We show how the formal specification language mCRL2 and its stateoftheart toolset can be used successfully to model and analyze variability in software product lines. The mCRL2 toolset supports parametrized modeling, model reduction and quality assurance techniques like model checking. We present a proofofconcept, which moreover illustrates the use of data in mCRL2 and also how to exploit its data language to manage feature attributes of software product lines and quantitative constraints between attributes and features.
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 5 (4 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.
Model Checking ValuePassing Modal Specifications
"... Abstract. Formal modelling and verification of variability concepts in product families has been the subject of extensive study in the literature on Software Product Lines. In recent years, we have laid the basis for the use of modal specifications and branchingtime temporal logics for the specific ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Formal modelling and verification of variability concepts in product families has been the subject of extensive study in the literature on Software Product Lines. In recent years, we have laid the basis for the use of modal specifications and branchingtime temporal logics for the specification and analysis of behavioural variability in product family definitions. A critical point in this formalization is the lack of a possibility to model an adequate representation of the data that may need to be described when considering real systems. To this aim, we now extend the modelling and verification environment that we have developed for specifications interpreted over Modal Transition Systems, by adding the possibility to include data in the specifications. In concert with this, we also extend the variabilityspecific modal logic and the associated specialpurpose model checker VMC. As a result, it offers the possibility to efficiently verify formulas over possibly infinitestate systems by using the onthefly bounded modelchecking algorithms implemented in the model checker. We illustrate our approach by means of a simple yet intuitive example: a bikesharing system. 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
(Show Context)
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.