Results 1  10
of
152
A brief history of process algebra
 THEOR. COMPUT. SCI
, 2004
"... 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 giv ..."
Abstract

Cited by 84 (1 self)
 Add to MetaCart
(Show Context)
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.
Modular structural operational semantics
, 2004
"... Modular SOS (MSOS) is a variant of conventional Structural Operational Semantics (SOS). Using MSOS, the transition rules for each construct of a programming language can be given incrementally, once and for all, and do not need reformulation when further constructs are added to the language. MSOS th ..."
Abstract

Cited by 78 (8 self)
 Add to MetaCart
Modular SOS (MSOS) is a variant of conventional Structural Operational Semantics (SOS). Using MSOS, the transition rules for each construct of a programming language can be given incrementally, once and for all, and do not need reformulation when further constructs are added to the language. MSOS thus provides an exceptionally high degree of modularity in language descriptions, removing a shortcoming of the original SOS framework. After sketching the background and reviewing the main features of SOS, the paper explains the crucial differences between SOS and MSOS, and illustrates how MSOS descriptions are written. It also discusses standard notions of semantic equivalence based on MSOS. Appendix A shows how the illustrative MSOS rules given in the paper would be formulated in conventional SOS.
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.
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 41 (4 self)
 Add to MetaCart
(Show Context)
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
A thread algebra with multilevel strategic interleaving
 Fundamenta Informaticae
, 2005
"... Abstract. In a previous paper, we developed an algebraic theory of threads and multithreads based on strategic interleaving. This theory includes a number of plausible interleaving strategies on thread vectors. The strategic interleaving of a thread vector constitutes a multithread. Several multi ..."
Abstract

Cited by 36 (33 self)
 Add to MetaCart
(Show Context)
Abstract. In a previous paper, we developed an algebraic theory of threads and multithreads based on strategic interleaving. This theory includes a number of plausible interleaving strategies on thread vectors. The strategic interleaving of a thread vector constitutes a multithread. Several multithreads may exist concurrently on a single host in a network, several host behaviors may exist concurrently in a single network on the internet, etc. Strategic interleaving is also present at these other levels. In the current paper, we extend the theory developed so far with features to cover multilevel strategic interleaving. We use the resulting theory to develop a simplified formal representation schema of systems that consist of several multithreaded programs on various hosts in different networks. We also investigate the connections of the resulting theory with the algebraic theory of processes known as ACP.
Process algebra with timing: real time and discrete time
 Smolka (Eds.), Handbook of Process Algebra
, 2001
"... We present real time and discrete time versions of ACP with absolute timing and relative timing. The startingpoint isanewrealtimeversion with absolute timing, called ACPsat, featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete time ve ..."
Abstract

Cited by 33 (11 self)
 Add to MetaCart
We present real time and discrete time versions of ACP with absolute timing and relative timing. The startingpoint isanewrealtimeversion with absolute timing, called ACPsat, featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete time versions of ACP being known as ACP dat and ACP drt. The principal version is an extension of ACP sat with integration and initial abstraction to allow for choices over an interval of time and relative timing to be expressed. Its main virtue is that it generalizes ACP without timing and most other versions of ACP with timing in a smooth and natural way. This is shown for the real time version with relative timing and the discrete time version with absolute timing.
A congruence rule format for namepassing process calculi from mathematical structural operational semantics
 In Proc. LICS’06
, 2006
"... We introduce a GSOSlike rule format for namepassing process calculi. Specifications in this format correspond to theories in nominal logic. The intended models of such specifications arise by initiality from a general categorical model theory. For operational semantics given in this rule format, a ..."
Abstract

Cited by 26 (5 self)
 Add to MetaCart
(Show Context)
We introduce a GSOSlike rule format for namepassing process calculi. Specifications in this format correspond to theories in nominal logic. The intended models of such specifications arise by initiality from a general categorical model theory. For operational semantics given in this rule format, a natural behavioural equivalence — a form of open bisimilarity — is a congruence.
GSOS for Probabilistic Transition Systems
, 2002
"... We introduce PGSOS, an operator specification format for (reactive) probabilistic transition systems which bears similarity to the known GSOS format for labelled (nondeterministic) transition systems. Like the standard one, the format is well behaved in the sense that on all models bisimilarity is a ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
We introduce PGSOS, an operator specification format for (reactive) probabilistic transition systems which bears similarity to the known GSOS format for labelled (nondeterministic) transition systems. Like the standard one, the format is well behaved in the sense that on all models bisimilarity is a congruence and the uptocontext proof principle is valid. Moreover, guarded recursive equations involving the specified operators have unique solutions up to bisimilarity. These results generalize wellbehavedness results given in the literature for specific operators that turn out to be definable by our format. PGSOS arose from the following procedure: Turi and Plotkin proposed to model specifications in the (standard) GSOS format as natural transformations of a type they call abstract GSOS. This formulation allows for simple proofs of several wellbehavedness properties, such as bisimilarity being a congruence on all models of such a specification. First, we give a full proof of Turi and Plotkin's claim about the correspondence of abstract GSOS and standard GSOS for labelled transition systems. Next, we instantiate their categorical framework to yield a specification format for probabilistic transition systems. The main contribution of the present paper is the derivation of the PGSOS format as a rulestyle representation of the natural transformations obtained this way. We benefit from the fact that some parts of our argument for the nondeterministic case can be reused. The wellbehavedness results for abstract GSOS immediately carry over to the new concrete format.
Axiomatizing GSOS with Termination
 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
, 2004
"... ..."