Skip Navigation

The Computer Journal 1987 30(6):498-506; doi:10.1093/comjnl/30.6.498
© 1987 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Baeten, J. C. M.
Right arrow Articles by Klop, J. W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator

J. C. M. Baeten *{dagger}, J. A. Bergstra{dagger},{ddagger} and J. W. Klop§

{dagger} Department of Computer Science, University of Amsterdam
{ddagger} Department of Philosophy, University of Utrecht
§ Centre for Mathematics and Computer Science, Amsterdam

Received 1 March 1986; revised 1 August 1986

We consider a process semantics intermediate between bi-simulation semantics and readiness semantics, called here ready-trace semantics. The advantage of this semantics is that, while retaining the simplicity of readiness semantics, it is still possible to augment this process model with the mechanism of atomic actions with priority (the {theta} operator). It is shown that in readiness semantics and a fortiori in failure semantics such an extension with {theta} is impossible. Ready-trace semantics is considered here in the simple setting of concrete process algebra, that is: without abstraction (no silent moves), moreover for finite processes only. For such finite processes without silent moves a complete axiomatisation of ready-trace semantics is given via the method of process graph transformations.

* To whom correspondence should be addressed.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.