Abstract
Rule formats are sets of syntactical constraints over SOS rules ensuring semantical properties of the derived LTS. Given a rule format, our proposal is to relax the constraints imposed on each single rule and to introduce some constraints on the form of the whole set of rules, thus obtaining a new format ensuring the same semantical property and being less demanding than the original one. We apply our idea to a well known rule format for rooted branching bisimulation equivalence.
| Original language | English |
|---|---|
| Pages (from-to) | 355-369 |
| Number of pages | 15 |
| Journal | Fundamenta Informaticae |
| Volume | 135 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2014 |
Other keywords
- rooted branching bisimulation
- specification format
- Weak equivalence