Results 1  10
of
12
Termination in Timed Process Algebra
 Formal Aspects of Computing
, 2000
"... We investigate different forms of termination in timed process algebras. The integrated framework of discrete and dense time, relative and absolute time process algebras is extended with forms of successful and unsuccessful termination. The different algebras are interrelated by embeddings and conse ..."
Abstract

Cited by 155 (25 self)
 Add to MetaCart
We investigate different forms of termination in timed process algebras. The integrated framework of discrete and dense time, relative and absolute time process algebras is extended with forms of successful and unsuccessful termination. The different algebras are interrelated by embeddings and conservative extensions.
A brief history of process algebra
 Theor. Comput. Sci
, 2004
"... Abstract. This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to the early seventies of the twentieth century, and developments since that time are sketched. The a ..."
Abstract

Cited by 57 (1 self)
 Add to MetaCart
Abstract. This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to the early seventies of the twentieth century, and developments since that time are sketched. The author gives his personal views on these matters. He also considers the present situation, and states some challenges for the future.
Fischer's Protocol in Timed Process Algebra
, 1994
"... Timed algebraic process theories can be developed with quite different purposes in mind. One can aim for theoretical results about the theory itself (completeness, expressiveness, decidability), or one can aim for practical applicability to nontrivial protocols. Unfortunately, these aims do not go ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Timed algebraic process theories can be developed with quite different purposes in mind. One can aim for theoretical results about the theory itself (completeness, expressiveness, decidability), or one can aim for practical applicability to nontrivial protocols. Unfortunately, these aims do not go well together. In this paper we take two theories, which are probably of the first kind, and try to find out how well suited they are for practical verifications. We verify Fischer's protocol for mutual exclusion in the settings of discretetime process algebra (ACP dt ) and realtime process algebra (ACP ur ). We do this by transforming the recursive specification into an equivalent linear specification, and then dividing out the maximal bisimulation relation. The required mutual exclusion result can then be found by reasoning about the obtained process graph. Finally, we consider the ease of the verification, and ways to adapt the theory to make it more practical. It will turn out that the...
Reniers. Timed process algebra (with a focus on explicit termination and relativetiming
 Proceedings of the International School on Formal Methods for the Design of RealTime Systems (SFMRTâ€™04), volume 3185 of Lecture Notes in Computer Science
, 2004
"... Abstract. We treat theory and application of timed process algebra. We focus on a variant that uses explicit termination and action prefixing. This variant has some advantages over other variants. We concentrate on relative timing, but the treatment of absolute timing is similar. We treat both discr ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. We treat theory and application of timed process algebra. We focus on a variant that uses explicit termination and action prefixing. This variant has some advantages over other variants. We concentrate on relative timing, but the treatment of absolute timing is similar. We treat both discrete and dense timing. We build up the theory incrementally. The different algebras are interrelated by embeddings and conservative extensions. As an example, we consider the PAR communication protocol. 1
TTCN: Towards a Formal Semantics and Validation of Test Suites
, 1996
"... TTCN (Tree and Tabular Combined Notation) is the standardized test notation for the description of OSI conformance tests. Since applicability of TTCN is restricted, work on the definition of concurrent TTCN, an extended version of TTCN for the specification of test cases for multi party testing, h ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
TTCN (Tree and Tabular Combined Notation) is the standardized test notation for the description of OSI conformance tests. Since applicability of TTCN is restricted, work on the definition of concurrent TTCN, an extended version of TTCN for the specification of test cases for multi party testing, has been started a few years ago. In this paper we discuss different approaches for the definition of an operational semantics of TTCN and concurrent TTCN and we discuss issues related to the validation of (concurrent) TTCN test cases. Because for the validation of test cases a proper semantics definition is a prerequisite we have developed a semantics definition which utilizes labelled transition systems as its basic model. The applicability of the model is demonstrated: First, we show how identified incompletenesses and ambiguities of TTCN can be solved. Second, we develop a validation framework that defines the necessary machinery for the validation of functional properties of test ...
A Complete Theory of Deterministic Event Structures
 Concur '95: Concurrency Theory, vol. 962 of LNCS
, 1995
"... . We present an !complete algebra of a class of deterministic event structures, which are labelled prime event structures where the labelling function satisfies a certain distinctness condition. The operators of the algebra are summation, sequential composition and join. Each of these gives rise to ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
. We present an !complete algebra of a class of deterministic event structures, which are labelled prime event structures where the labelling function satisfies a certain distinctness condition. The operators of the algebra are summation, sequential composition and join. Each of these gives rise to a monoid; in addition a number of distributivity properties hold. Summation loosely corresponds to choice and join to parallel composition, with however some nonstandard aspects. The space of models is a complete partial order (in fact a complete lattice) in which all operators are continuous; hence minimal fixpoints can be defined inductively. Moreover, the submodel relation can be captured within the algebra by summation (x v y iff x + y = y); therefore the effect of fixpoints can be captured by an infinitary proof rule, yielding a complete proof system for recursively defined deterministic event structures. 1 Introduction It is generally recognised that prime event structures constitut...
Towards a MetaTheory of Operational Semantics
, 1992
"... Introduction There are several ways to give a semantics of a programming language. Each kind of semantics gives a different insight into the meaning of a language, and is useful for different tasks. The axiomatic approach specifies a language by means of the properties it possesses. Such a specific ..."
Abstract
 Add to MetaCart
Introduction There are several ways to give a semantics of a programming language. Each kind of semantics gives a different insight into the meaning of a language, and is useful for different tasks. The axiomatic approach specifies a language by means of the properties it possesses. Such a specification need not necessarily be complete. Examples of such systems are Hoare Logic [Apt81] and Dijkstra's predicate transformers [DS90]. . Such a semantics is useful when one is still working out the details of the language, and also for highlighting important features to users. The denotational approach is to define a function from programs to their meanings. These meanings, or denotations, are mathematical values which represent the result of running the program. Such a semantics is useful for users and designers of languages. Schmidt [Sch88] contains an excellent introduction to denotational semantics. The operational approach is to define a kind of mathematical mach
Deterministic Pomsets
, 1994
"... This paper is about partially ordered multisets (pomsets for short). We investigate a particular class of pomsets that we call deterministic, properly including all partially ordered sets, which satisfies a number of interesting properties: among other things, it forms a distributive lattice under ..."
Abstract
 Add to MetaCart
This paper is about partially ordered multisets (pomsets for short). We investigate a particular class of pomsets that we call deterministic, properly including all partially ordered sets, which satisfies a number of interesting properties: among other things, it forms a distributive lattice under pomset prefix (hence prefix closed sets of deterministic pomsets are prime algebraic), and it constitutes a reflective subcategory of the category of all pomsets. For the deterministic pomsets we develop an algebra with a sound and (#)complete equational theory. The operators in the algebra are concatenation and join, the latter being a variation on the more usual disjoint union of pomsets with the special property that it yields the least upper bound with respect to pomset prefix. This theory is then extended in several ways. We capture refinement of pomsets by incorporating homomorphisms between models as objects in the algebra and homomorphism application as a new operator. This in turn...
Algebra of Broadcasting Systems: Value Passing, Sequential Composition, and Fork
, 1994
"... This paper presents ACBS&, Algebra of Broadcasting Systems with Fork, a process calculus with broadcast communication, which combines value passing and sequential composition. Putting value passing into a calculus with sequential composition turns out to be more complicated than with a prefixing ..."
Abstract
 Add to MetaCart
This paper presents ACBS&, Algebra of Broadcasting Systems with Fork, a process calculus with broadcast communication, which combines value passing and sequential composition. Putting value passing into a calculus with sequential composition turns out to be more complicated than with a prefixing calculus. A semantics for such a calculus can be defined using environments, as in imperative languages. Parallel processes have parallel environments, which can lead to ambiguity which of the environments shall be passed on to the sequentially following process. ACBS& solves this problem by distinguishing a foreground and a background process. The resulting operator can be interpreted as a fork operator, which "forks off" a background process. The calculus is presented both in a "pure" and a value passing version, together with a complete axiomatisation for the pure calculus. 1 Introduction The basic ingredients of the calculus ACBS& are: ffl CBS with its basic idea broadcast communication...
Process Algebra: An Algebraic Theory of Concurrency
"... Abstract. This tutorial provides an overview of the process algebra ACP. 1 ..."
Abstract
 Add to MetaCart
Abstract. This tutorial provides an overview of the process algebra ACP. 1