Scholarlink

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.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

From Complementary to Zipper Semantics

  • 章节

  • 发表日期：

    2026年

查看全文
  • Sergueï Lenglet,
  • Camille Noûs,
  • Alan Schmitt

摘要

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.