 |
computer science |
||
Process Languages for Rooted Eager Bisimulation,Irek Ulidowski and Shoji Yuen, In C. Palamidessi, editor, Proceedings of the 11th International Conference on Concurrency Theory CONCUR 2000, University Park, Pennsylvania, 2000. Springer, LNCS 1877. Abstract We present a general class of process languages for rooted eager bisimulation preorder and prove its congruence result. Also, we present classes of process languages for the rooted versions of several other weak preorders. The process languages we propose are defined by the Ordered SOS method which combines the traditional SOS approach, based on transition rules, with the ordering on transition rules. This new feature specifies the order of application of rules when deriving transitions of process terms. We support and illustrate our results with examples of process operators and process languages which benefit from the OSOS formulation. This paper is available in ps form. |
|
![[University Home]](/images/unihome.gif){kind=small} |![[Faculty of Science]](/images/fac_of_science.gif){kind=small} |![[MCS Home]](/images/schhome.gif){kind=small} |![[CS Home]](/images/depthome.gif){kind=small} ||![[University Index A-Z]](/images/index.gif){kind=small} |![[University Search]](/images/search.gif){kind=small} |![[University Help]](/images/help.gif){kind=small} |
|
|
Author: Irek Ulidowski (I.Ulidowski@mcs.le.ac.uk). |
|