Sciweavers

22 search results - page 2 / 5
» Weak Sequential Composition in Process Algebras
Sort
View
FUIN
2007
122views more  FUIN 2007»
13 years 4 months ago
Behaviour Algebras
The paper is concerned with algebras whose elements can be used to represent runs of a system, called processes. These algebras, called behaviour algebras, are categories with resp...
Józef Winkowski
BIRTHDAY
2005
Springer
13 years 10 months ago
Timing the Untimed: Terminating Successfully While Being Conservative
Abstract. There have been several timed extensions of ACP-style process algebras with successful termination. None of them, to our knowledge, are equationally conservative (ground-...
Jos C. M. Baeten, Mohammad Reza Mousavi, Michel A....
BIRTHDAY
2004
Springer
13 years 10 months ago
Retracing the Semantics of CSP
CSP was originally introduced as a parallel programming language in which sequential imperative processes execute concurrently and communicate by synchronized input and output. The...
Stephen D. Brookes
JLP
2011
106views more  JLP 2011»
12 years 7 months ago
Concurrent Kleene Algebra and its Foundations
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
Tony Hoare, Bernhard Möller, Georg Struth, Ia...
FUIN
2008
124views more  FUIN 2008»
13 years 5 months ago
Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity
In this paper, we show how to obtain causal semantics distinguishing "earlier than" and "not later than" causality between events from algebraic semantics of Pe...
Gabriel Juhás, Robert Lorenz, Sebastian Mau...