From Complementary to Zipper Semantics
Résumé
We present two serialized semantics format for process calculi based on labeled transition systems. Complementary semantics are useful to prove the congruence of bisimilarity. Zipper semantics are the first step toward the automatic derivation of an abstract machine. Both semantics are based on the same restrictions: inductive rules have at most one premise and some contextual information is kept in the label.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |