Proof search specifications of bisimulation and modal logics for the n-calculus
Date
2010
Authors
Tiu, Alwen
Miller, Dale
Journal Title
Journal ISSN
Volume Title
Publisher
Association for Computing Machinery Inc (ACM)
Abstract
We specify the operational semantics and bisimulation relations for the finite π-calculus within a logic that contains the ∇ quantifier for encoding generic judgments and definitions for encoding fixed points. Since we restrict to the finite case, the
Description
Keywords
Keywords: Bisimulations; Generic judgments; Higher-order abstract syntax; Modal logic; Proof search; Abstracting; Encoding (symbols); Semantics; Specifications; Syntactics; Calculations ?-tree syntax; p-calculus; ? quantifier; Bisimulation; Generic judgments; Higher-order abstract syntax; Modal logics; Proof search
Citation
Collections
Source
ACM Transactions on Computational Logic
Type
Journal article
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description