Formats of Ordered SOS Rules with Silent Actions (1997)
Cached
Download Links
- [theory.doc.ic.ac.uk]
- [theory.doc.ic.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | Proceedings 7th Conference on Theory and Practice of Software Development (TAPSOFT'97), Lille, LNCS 1214 |
| Citations: | 7 - 3 self |
BibTeX
@INPROCEEDINGS{Ulidowski97formatsof,
author = {Irek Ulidowski and Iain Phillips},
title = {Formats of Ordered SOS Rules with Silent Actions},
booktitle = {Proceedings 7th Conference on Theory and Practice of Software Development (TAPSOFT'97), Lille, LNCS 1214},
year = {1997},
pages = {297--308},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a general and uniform method for defining structural operational semantics (SOS) of process algebra operators by traditional Plotkin-style rules equipped with an ordering, the new feature which states the order of application of rules when deriving transitions of process terms. Our method allows to represent negative premises and copying in the presence of silent actions. We identify a number of general formats of unordered and ordered rules with silent actions and show that divergence sensitive branching and weak bisimulation relations are preserved by all operators in the relevant formats. A comparison with the existing formats for branching and weak bisimulations shows that our formats are more general.
