## A Congruence Theorem for Structured Operational Semantics With Predicates (1993)

### Cached

### Download Links

- [www.win.tue.nl:8080]
- [adam.wins.uva.nl]
- [adam.wins.uva.nl]
- DBLP

### Other Repositories/Bibliography

Citations: | 109 - 5 self |

### BibTeX

@MISC{Baeten93acongruence,

author = {J.C.M. Baeten and C. Verhoef},

title = {A Congruence Theorem for Structured Operational Semantics With Predicates},

year = {1993}

}

### Years of Citing Articles

### OpenURL

### Abstract

. We proposed a syntactical format, the path format, for structured operational semantics in which predicates may occur. We proved that strong bisimulation is a congruence for all the operators that can be defined within the path format. To show that this format is useful we provided many examples that we took from the literature about CCS, CSP, and ACP; they do satisfy the path format but no formats proposed by others. The examples include concepts like termination, convergence, divergence, weak bisimulation, a zero object, side conditions, functions, real time, discrete time, sequencing, negative premises, negative conclusions, and priorities (or a combination of these notions). Key Words & Phrases: structured operational semantics, term deduction system, transition system specification, structured state system, labelled transition system, strong bisimulation, congruence theorem, predicate. 1980 Mathematics Subject Classification (1985 Revision): 68Q05, 68Q55. CR Categories: D.3.1...