Results 1  10
of
24
Process algebra for synchronous communication
 Inform. and Control
, 1984
"... Within the context of an algebraic theory of processes, an equational specification of process cooperation is provided. Four cases are considered: free merge or interleaving, merging with communication, merging with mutual exclusion of tight regions, and synchronous process cooperation. The rewrite ..."
Abstract

Cited by 364 (51 self)
 Add to MetaCart
Within the context of an algebraic theory of processes, an equational specification of process cooperation is provided. Four cases are considered: free merge or interleaving, merging with communication, merging with mutual exclusion of tight regions, and synchronous process cooperation. The rewrite system behind the communication algebra is shown to be confluent and terminating (modulo its permutative reductions). Further, some relationships are shown to hold between the four concepts of merging. © 1984 Academic Press, Inc.
Turning SOS Rules into Equations
, 1994
"... Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of [15]. We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinit ..."
Abstract

Cited by 89 (20 self)
 Add to MetaCart
Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of [15]. We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinitary induction principle) which precisely characterizes strong bisimulation of processes.
An Algebraic Verification of a Mobile Network
 Formal Aspects of Computing
, 1991
"... . In a mobile communication network some nodes change locations, and are therefore connected to different other nodes at different points in time. We show how some important aspects of such a network can be formally defined and verified using the \picalculus, which is a development of CCS (Calculus ..."
Abstract

Cited by 39 (1 self)
 Add to MetaCart
. In a mobile communication network some nodes change locations, and are therefore connected to different other nodes at different points in time. We show how some important aspects of such a network can be formally defined and verified using the \picalculus, which is a development of CCS (Calculus of Communicating Systems) allowing port names to be sent as parameters in communication events. As an example of a mobile network we consider the Public Land Mobile Network currently being developed by the European Telecommunication Standards Institute and concentrate on the handover procedure which controls the dynamic topology of the network. 1. Introduction The need for mathematically rigorous definitions of communication protocol standards is today widely acknowledged. Such definitions are needed to specify protocols and services, and to verify that the protocols fulfil their services. Unfortunately most protocols still rely on informal definitions. One reason for this is that many aspec...
Deciding Bisimulation Equivalences for a Class of NonFiniteState Programs
, 1991
"... Traditionally, many automatic program verification techniques are applicable only to finitestate programs. In this paper we extend some of these techniques to a class of infinitestate programs that, in addition to having a finitestate control component, may read, store, and write but not perfo ..."
Abstract

Cited by 37 (9 self)
 Add to MetaCart
Traditionally, many automatic program verification techniques are applicable only to finitestate programs. In this paper we extend some of these techniques to a class of infinitestate programs that, in addition to having a finitestate control component, may read, store, and write but not perform any other computations on data. Such programs are dataindependent in the sense that their behavior does not depend on the actual data values supplied. We consider the problems of deciding strong equivalence and observation equivalence, defined by bisimulations (as in CCS), between such programs. These equivalences have major applications in verification of communication protocols. We present reductions of these problems to the problem of deciding strong equivalence and observation equivalence between finitestate programs, for which polynomial time algorithms exist. The equivalence problems on dataindependent programs are shown to be NPhard in the size of the programs. 4 1 I...
Process algebra for hybrid systems
 Theoretical Computer Science
, 2003
"... Abstract. We propose a process algebra obtained by extending a combination of the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, Chap. 4, 2002] and the process algebra with propositional signals from Baeten and ..."
Abstract

Cited by 27 (3 self)
 Add to MetaCart
Abstract. We propose a process algebra obtained by extending a combination of the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, Chap. 4, 2002] and the process algebra with propositional signals from Baeten and
Process Algebra with Iteration
, 1994
"... We introduce iteration in process algebra by means of (the binary version of) Kleene's star operator: x y is the process that chooses between x and y, and upon termination of x has this choice again. It is proved that adding respectively interleaving, communication and abstraction operators incr ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
We introduce iteration in process algebra by means of (the binary version of) Kleene's star operator: x y is the process that chooses between x and y, and upon termination of x has this choice again. It is proved that adding respectively interleaving, communication and abstraction operators increases expressivity up to the regular processes. However, if the distinction between (successful) termination and deadlock is dropped, ACP (the Algebra of Communicating Processes, [BK84b]) with is expressive up to the regular processes. Finally, some attention is paid to other iteration operators and fairness issues, and some open questions are formulated. Key words & Phrases: process algebra, iteration, Kleene star. 1987 CR Categories: F.1.1, F.1.2, F.3.2, F.4.3, I.1.0. Note: An earlier version of this work was presented at the REX Symposium, Noordwijkerhout, June 14, 1993. 1 Introduction In 1956, Kleene introduced in [Kle56] the binary operator for describing `regular events'. T...
Formalizing Process Algebraic Verifications in the Calculus of Constructions
"... This paper reports on the first steps towards the formal verification of correctness proofs of reallife protocols in process algebra. We show that proofs can be verified, and partly constructed, by a general purpose proof checker. The process algebra we use is µCRL, ACP augmented with data, wh ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
This paper reports on the first steps towards the formal verification of correctness proofs of reallife protocols in process algebra. We show that proofs can be verified, and partly constructed, by a general purpose proof checker. The process algebra we use is µCRL, ACP augmented with data, which is small enough to make the verification feasible, and at the same time expressive enough for the specification of reallife protocols. The proof checker we use is Coq, which is based on the Calculus of Constructions, an extension of simply typed lambda calculus. The focus is on the translation of the proof theory of µCRL and µCRLspecifications to Coq. As a case study, we verified the Alternating Bit Protocol.
Compositional reasoning for probabilistic finitestate behaviors
 In Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday, LNCS 3838
, 2005
"... Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider strong bisimulation and observational equivalence, and provide complete axiomatizations for a language that includes para ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider strong bisimulation and observational equivalence, and provide complete axiomatizations for a language that includes parallel composition and (guarded) recursion. The presence of the parallel composition introduces various technical difficulties and some restrictions are necessary in order to achieve complete axiomatizations. 1
SOS formats and metatheory: 20 years after
, 2007
"... In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin, A structural approach to operational semantics, Technical ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin, A structural approach to operational semantics, Technical
A Testing Scenario for Probabilistic Automata
 Proceedings 30 th ICALP, volume 2719 of Lecture Notes in Computer Science
, 2003
"... Recently, a large number of equivalences for probabilistic automata has been proposed in the literature. Except for the probabilistic bisimulation of Larsen & Skou, none of these equivalences has been characterized in terms of intuitive testing scenarios. In our view, this is an undesirable situ ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Recently, a large number of equivalences for probabilistic automata has been proposed in the literature. Except for the probabilistic bisimulation of Larsen & Skou, none of these equivalences has been characterized in terms of intuitive testing scenarios. In our view, this is an undesirable situation: in the end, the behavior of an automaton is what an external observer perceives. In this paper, we propose and study a simple and intuitive testing scenario for probabilistic automata. We prove that the equivalence induced by this scenario coincides with the trace distribution equivalence proposed by Segala. A technical result that we need to establish on the way is an Approximation Induction Principle (AIP) for probabilistic processes.