Results 11  20
of
426
An Algebraic Semantics of Basic Message Sequence Charts
 The Computer Journal
, 1994
"... Message Sequence Charts are a widely used technique for the visualization of the communication between system components. We present a formal semantics of Basic Message Sequence Charts, exploiting techniques from process algebra. This semantics is based on the semantics of the full language as being ..."
Abstract

Cited by 79 (13 self)
 Add to MetaCart
Message Sequence Charts are a widely used technique for the visualization of the communication between system components. We present a formal semantics of Basic Message Sequence Charts, exploiting techniques from process algebra. This semantics is based on the semantics of the full language as being proposed for standardization in the International Telecommunication Union.
Algebraic Process Verification
 Handbook of Process Algebra, chapter 17
"... This chapter addresses the question how to verify distributed and communicating systems in an e#ective way from an explicit process algebraic standpoint. This means that all calculations are based on the axioms and principles of the process algebras. ..."
Abstract

Cited by 76 (16 self)
 Add to MetaCart
This chapter addresses the question how to verify distributed and communicating systems in an e#ective way from an explicit process algebraic standpoint. This means that all calculations are based on the axioms and principles of the process algebras.
The Tile Model
 PROOF, LANGUAGE AND INTERACTION: ESSAYS IN HONOUR OF ROBIN MILNER
, 1996
"... In this paper we introduce a model for a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both from the world of term rewriting, in particular from the rewriting logic framework [Mes92], and of concurrency theory: among the ..."
Abstract

Cited by 72 (27 self)
 Add to MetaCart
In this paper we introduce a model for a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both from the world of term rewriting, in particular from the rewriting logic framework [Mes92], and of concurrency theory: among the others, the structured operational semantics [Plo81], the context systems [LX90] and the structured transition systems [CM92] approaches. Our model recollects many properties of these sources: first, it provides a compositional way to describe both the states and the sequences of transitions performed by a given system, stressing their distributed nature. Second, a suitable notion of typed proof allows to take into account also those formalisms relying on the notions of synchronization and sideeffects to determine the actual behaviour of a system. Finally, an equivalence relation over sequences of transitions is defined, equipping the system under analysis with a concurrent semantics, ...
Implementation of Symbolic Model Checking for Probabilistic Systems
, 2002
"... In this thesis, we present ecient implementation techniques for probabilistic model checking, a method which can be used to analyse probabilistic systems such as randomised distributed algorithms, faulttolerant processes and communication networks. A probabilistic model checker inputs a probabilist ..."
Abstract

Cited by 72 (21 self)
 Add to MetaCart
In this thesis, we present ecient implementation techniques for probabilistic model checking, a method which can be used to analyse probabilistic systems such as randomised distributed algorithms, faulttolerant processes and communication networks. A probabilistic model checker inputs a probabilistic model and a speci cation, such as \the message will be delivered with probability 1", \the probability of shutdown occurring is at most 0.02" or \the probability of a leader being elected within 5 rounds is at least 0.98", and can automatically verify if the speci cation is true in the model.
Parallel State Space Construction for ModelChecking
, 2001
"... The verification of concurrent finitestate systems by modelchecking often requires to generate (a large part of) the state space of the system under analysis. Because of the state explosion problem, this may be a resourceconsuming operation, both in terms of memory and Cpu time. In this report, w ..."
Abstract

Cited by 70 (6 self)
 Add to MetaCart
The verification of concurrent finitestate systems by modelchecking often requires to generate (a large part of) the state space of the system under analysis. Because of the state explosion problem, this may be a resourceconsuming operation, both in terms of memory and Cpu time. In this report, we aim at improving the performances of state space construction by using parallelization techniques. We present parallel algorithms for constructing state spaces (or Labeled Transition Systems) on a network or a cluster of workstations. Each node in the network builds a part of the state space, all parts being merged to form the whole state space upon termination of the parallel computation. These algorithms have been implemented within the Cadp verification tool set and experimented on various concurrent applications specified in Lotos. The results obtained show linear speedups and a good load balancing between network nodes.
Compositional Reachability Analysis Using Process Algebra
 IN PROCEEDINGS OF THE SYMPOSIUM ON TESTING, ANALYSIS, AND VERIFICATION (TAV4
, 1991
"... State explosion is the primary obstacle to practical application of reachability analysis techniques for concurrent systems. State explosion can be substantially controlled by using process algebra to achieve compositional (divideandconquer) analysis. A prototype tool incorporating process algebra ..."
Abstract

Cited by 64 (3 self)
 Add to MetaCart
State explosion is the primary obstacle to practical application of reachability analysis techniques for concurrent systems. State explosion can be substantially controlled by using process algebra to achieve compositional (divideandconquer) analysis. A prototype tool incorporating process algebra is described. The promise and problems of the approach are illustrated by applying the tool to an example that incorporates the alternating bit protocol as a module.
The Discrete Time ToolBus  a software coordination architecture
, 1998
"... . The notion of "time" plays an important role when coordinating ..."
Abstract

Cited by 63 (13 self)
 Add to MetaCart
. The notion of "time" plays an important role when coordinating
Thread algebra for strategic interleaving
 FORMAL ASPECTS OF COMPUTING
, 2007
"... We present an extension of the polarized process algebra BPPA, an algebraic theory about sequential program behaviors. The extension is called thread algebra and is proposed as a tool for the description and analysis of multithreaded program behaviors. Strategic interleaving refers to the form of ..."
Abstract

Cited by 58 (50 self)
 Add to MetaCart
We present an extension of the polarized process algebra BPPA, an algebraic theory about sequential program behaviors. The extension is called thread algebra and is proposed as a tool for the description and analysis of multithreaded program behaviors. Strategic interleaving refers to the form of concurrency where some interleaving strategy is used rather than arbitrary interleaving. Strategic interleaving is considered characteristic of multithreading. Multithreaded concurrency is more limited than general concurrency based on arbitrary interleaving.
Sheaf Semantics for Concurrent Interacting Objects
 Mathematical Structures in Computer Science
, 1992
"... : This paper uses concepts from sheaf theory to explicate phenomena in concurrent systems, including object, inheritance, deadlock, and noninterference, as used in computer security. The approach is very general, and applies not only to concurrent object oriented systems, but also to systems of dif ..."
Abstract

Cited by 54 (5 self)
 Add to MetaCart
(Show Context)
: This paper uses concepts from sheaf theory to explicate phenomena in concurrent systems, including object, inheritance, deadlock, and noninterference, as used in computer security. The approach is very general, and applies not only to concurrent object oriented systems, but also to systems of differential equations, electrical circuits, hardware description languges, and much more. Time can be discrete or continuous, linear or branching, and distribution is allowed over space as well as time. Concepts from category theory help to achieve this generality: objects are modeled by sheaves; inheritance by sheaf morphisms; systems by diagrams; and interconnections by diagrams of diagrams. In addition, behaviour is given by limit, and the result of interconnection by colimit. The approach is illustrated with many examples, including a semantics for a simple concurrent objectbased programming language. 1 Introduction Many popular formalisms for concurrent systems are syntactic (or "formal...