The Syntax and Semantics of μCRL

Groote, Jan Friso; Ponse, Alban

doi:10.1007/978-1-4471-2120-6_2

Cited by 168 publications

(151 citation statements)

References 15 publications

Supporting

Mentioning

150

Contrasting

Order By: Relevance

“…Process algebras which encompass functions have previously appeared in the literature (see for example μCRL [6] [7]). However the role of the functions here is somewhat different.…”

Section: Related Workmentioning

confidence: 99%

A Function-Equivalent Components Based Simplification Technique for PEPA Models

Hillston

Kloul²

2006

Formal Methods and Stochastic Models for Performance Evaluation

View full text Add to dashboard Cite

Abstract. PEPA has recently been extended with functional rates [1] [2]. These functions allow the specification of indirect interaction between components in such a way that the rate of an activity may be made dependent on the local state currently exhibited by one or more components. In this paper we demonstrate that these rates allow a systematic simplification of models in which there is appropriate indirect interaction between components. We investigate the interplay between this style of simplification and aggregation based on bisimulation, and establish a heuristic for applying both techniques in a complementary fashion.

show abstract

“…Process algebras which encompass functions have previously appeared in the literature (see for example μCRL [6] [7]). However the role of the functions here is somewhat different.…”

Section: Related Workmentioning

confidence: 99%

A Function-Equivalent Components Based Simplification Technique for PEPA Models

Hillston

Kloul²

2006

Formal Methods and Stochastic Models for Performance Evaluation

View full text Add to dashboard Cite

show abstract

“…For the purpose of verification Erlang programs are translated into the µCRL process algebra [5] by an automatic translator tool [2]. In µCRL behaviour is described on two levels, as traditional process behaviour using the process algebra operators of µCRL (sequencing, parallel composition, recursion, communication using synchronisation, etc), and data kept by processes and exchanged in communications.…”

Section: Translating Fault-tolerant Systems To µCrlmentioning

confidence: 99%

Verification of Language Based Fault-Tolerance

Earle

Fredlund

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper we target the verification of fault tolerant aspects of distributed applications written in the Erlang programming language. Erlang programmers mostly work with ready-made language components. Our approach to verification of fault tolerance is to verify systems built using a central component of most Erlang software, a generic server component with fault tolerance handling.To verify such Erlang programs we automatically translate them into processes of the µCRL process algebra, generate their state spaces, and use a model checker to determine whether they satisfy correctness properties specified in the µ-calculus.The key observation of this paper is that, due to the usage of these higher-level design patterns, the state space generated from a Erlang program, even with failures occurring, is relatively small, and can be generated automatically.

show abstract

“…Interfaces can be generated automatically from systems made of Ltss composed using operators taken from several languages (Ccs [29], Csp [4], μCrl [21], Lotos [22], the E-Lotos international standard [24], and general concurrent specification formalisms). In the framework of Lotos specifications, the Svl scripting language was also extended to facilitate the combined use of the various Cadp tools involved to use refined interfaces in a compositional verification task.…”

Section: Introductionmentioning

confidence: 99%

Refined Interfaces for Compositional Verification

Lang

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The compositional verification approach of Graf & Steffen aims at avoiding state space explosion for individual processes of a concurrent system. It relies on interfaces that express the behavioural constraints imposed on each process by synchronization with the other processes, thus preventing the exploration of states and transitions that would not be reachable in the global state space. Krimm & Mounier, and Cheung & Kramer proposed two techniques to generate such interfaces automatically. In this paper, we propose a refined interface generation technique, in which the interface of a process is derived automatically from the examination of (a subset of) concurrent processes. This technique is applicable to formalisms in which concurrent processes are composed either using synchronization vectors or process algebra parallel composition operators (including those of Ccs, Csp, μCrl, Lotos, and E-Lotos), for which we developed a tool. Several experiments indicate state space reductions by more than two orders of magnitude for the largest processes.

show abstract

The Syntax and Semantics of μCRL

Cited by 168 publications

References 15 publications

A Function-Equivalent Components Based Simplification Technique for PEPA Models

A Function-Equivalent Components Based Simplification Technique for PEPA Models

Verification of Language Based Fault-Tolerance

Refined Interfaces for Compositional Verification

Contact Info

Product

Resources

About