Results 1  10
of
217
A Compositional Approach to Performance Modelling
, 1996
"... Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more ea ..."
Abstract

Cited by 746 (102 self)
 Add to MetaCart
Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more easily modelled. In this thesis a novel compositional approach to performance modelling is presented. This approach is based on a suitably enhanced process algebra, PEPA (Performance Evaluation Process Algebra). The compositional nature of the language provides benefits for model solution as well as model construction. An operational semantics is provided for PEPA and its use to generate an underlying Markov process for any PEPA model is explained and demonstrated. Model simplification and state space aggregation have been proposed as means to tackle the problems of large performance models. These techniques are presented in terms of notions of equivalence between modelling entities. A framewo...
Modal and Temporal Logics for Processes
, 1996
"... this paper have been presented at the 4th European Summer School in Logic, Language and Information, University of Essex, 1992; at the Tempus Summer School for Algebraic and Categorical Methods in Computer Science, Masaryk University, Brno, 1993; and the Summer School in Logic Methods in Concurrency ..."
Abstract

Cited by 91 (2 self)
 Add to MetaCart
in Concurrency, Aarhus University, 1993. I would like to thank the organisers and the participants of these summer schools, and of the Banff higher order workshop. I would also like to thank Julian Bradfield for use of his Tex tree constructor for building derivation trees and Carron Kirkwood, Faron Moller
More Infinite Results
 UNIVERSITY OF PASSAU. UNIVERSITY OF PASSAU
, 1996
"... Recently there has been a spurt of activity in concurrency theory centered on the analysis of infinitestate systems. The following two problems have been intensely investigated: (1) given two infinitestate systems, are they equal with respect to a certain equivalence notion?, and (2) given an i ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
an infinitestate system and a property expressed in a certain temporal logic, does the system satisfy the property? In his CONCUR '96 paper, Faron Moller surveys some of the key results on the decidability and complexity of (1). The purpose of this paper for CONCUR's satellite INFINITY Workshop
Verification on Infinite Structures
, 2000
"... In this chapter, we present a hierarchy of infinitestate systems based on the primitive operations of sequential and parallel composition; the hierarchy includes a variety of commonlystudied classes of systems such as contextfree and pushdown automata, and Petri net processes. We then examine the ..."
Abstract

Cited by 91 (2 self)
 Add to MetaCart
In this chapter, we present a hierarchy of infinitestate systems based on the primitive operations of sequential and parallel composition; the hierarchy includes a variety of commonlystudied classes of systems such as contextfree and pushdown automata, and Petri net processes. We then examine the equivalence and regularity checking problems for these classes, with special emphasis on bisimulation equivalence, stressing the structural techniques which have been devised for solving these problems. Finally, we explore the model checking problem over these classes with respect to various linear and branchingtime temporal logics.
Infinite Results
, 1996
"... Recently there has been a spurt of activity in concurrency theory centred on the analysis of infinitestate systems. Much of this work stems from a task dedicated to the study in the recentlyconcluded ESPRIT BRA Concur2, and much of it has subsequently appeared in the proceedings of the annual CO ..."
Abstract

Cited by 66 (5 self)
 Add to MetaCart
Recently there has been a spurt of activity in concurrency theory centred on the analysis of infinitestate systems. Much of this work stems from a task dedicated to the study in the recentlyconcluded ESPRIT BRA Concur2, and much of it has subsequently appeared in the proceedings of the annual CONCUR conference. In this paper, we present an overview of various results obtained regarding expressivity, decidability, and complexity, focussing on the various techniques exploited in each case.
More Infinite Results
, 1997
"... Recently there has been a spurt of activity in concurrency theory centred on the analysis of infinitestate systems. The following two problems have been intensely investigated: (1) given two infinitestate systems, are they equal with respect to a certain equivalence notion?, and (2) given an infin ..."
Abstract

Cited by 38 (2 self)
 Add to MetaCart
an infinitestate system and a property expressed in a certain temporal logic, does the system satisfy the property? In his paper "Infinite Results" [Mol96] , Moller surveys some of the key results on the decidability and complexity of problem (1). This paper is a survey on the results about problem
Algebraic Theories for NamePassing Calculi
, 1996
"... In a theory of processes the names are atomic data items which can be exchanged and tested for identity. A wellknown example of a calculus for namepassing is the πcalculus, where names additionally are used as communication ports. We provide complete axiomatisations of late and early bisimulation ..."
Abstract

Cited by 52 (10 self)
 Add to MetaCart
In a theory of processes the names are atomic data items which can be exchanged and tested for identity. A wellknown example of a calculus for namepassing is the πcalculus, where names additionally are used as communication ports. We provide complete axiomatisations of late and early bisimulation equivalences in such calculi. Since neither of the equivalences is a congruence we also axiomatise the corresponding largest congruences. We consider a few variations of the signature of the language; among these, a calculus of deterministic processes which is reminiscent of sequential functional programs with a conditional construct. Most of our axioms are shown to be independent. The axiom systems differ only by a few simple axioms and reveal the similarities and the symmetries of the calculi and the equivalences.
The importance of the left merge operator in process algebras
 Proceedings 17 th ICALP
"... Abstract. In this paper, we examine quational a~xiomatisations for PA, the process algebra of Bergstra and Klop, which is a simple subset of their full language ACP. The language PA has two combinators for concurrent execution: theusual full merge operator ~ and the more esoteric left merge operator ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
Abstract. In this paper, we examine quational a~xiomatisations for PA, the process algebra of Bergstra and Klop, which is a simple subset of their full language ACP. The language PA has two combinators for concurrent execution: theusual full merge operator ~ and the more esoteric left merge operator [. Though this latter combinator is somewhat semantically unusual, we demonstrate its importance by proving that, whereas a finite sound and complete equa ional theory exists for PA, no such finite theory can exist for PA in the absence of the left merge operator. 1
Verification of Parallel Systems via Decomposition
 In Proc. of CONCUR 1992, LNCS 630
, 1992
"... Recently, Milner and Moller have presented several decomposition results for processes. Inspired by these, we investigate decomposition techniques for the verification of parallel systems. In particular, we consider those of the form q j (I) where p i and q j are (finite) state systems. We pro ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Recently, Milner and Moller have presented several decomposition results for processes. Inspired by these, we investigate decomposition techniques for the verification of parallel systems. In particular, we consider those of the form q j (I) where p i and q j are (finite) state systems. We
Results 1  10
of
217