A CHARACTERISATION OF OPEN BISIMILARITY USING AN INTUITIONISTIC MODAL LOGIC

被引:2
作者
Ahn, Ki Yung [1 ]
Horne, Ross [2 ]
Tiu, Alwen [3 ]
机构
[1] Hannam Univ, Dept Comp Engn, Daejeon, South Korea
[2] Univ Luxembourg, Comp Sci, Esch Sur Alzette, Luxembourg
[3] Australian Natl Univ, Res Sch Comp Sci, Canberra, ACT, Australia
关键词
bisimulation; modal logic; intuitionistic logic; SYSTEM;
D O I
10.46298/LMCS-17(3:2)2021
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Open bisimilarity is defined for open process terms in which free variables may appear. The insight is, in order to characterise open bisimilarity, we move to the setting of intuitionistic modal logics. The intuitionistic modal logic introduced, called OM, is such that modalities are closed under substitutions, which induces a property known as intuitionistic hereditary. Intuitionistic hereditary reflects in logic the lazy instantiation of free variables performed when checking open bisimilarity. The soundness proof for open bisimilarity with respect to our intuitionistic modal logic is mechanised in Abella. The constructive content of the completeness proof provides an algorithm for generating distinguishing formulae, which we have implemented. We draw attention to the fact that there is a spectrum of bisimilarity congruences that can be characterised by intuitionistic modal logics.
引用
收藏
页数:40
相关论文
共 33 条
[1]   The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication [J].
Abadi, Martin ;
Blanchet, Bruno ;
Fournet, Cedric .
JOURNAL OF THE ACM, 2018, 65 (01)
[2]  
Ahn K.Y., 2017, 28 INT C CONC THEOR, V85, p7:1, DOI [10.4230/LIPIcs.CONCUR.2017.7, DOI 10.4230/LIPICS.CONCUR.2017.7]
[3]  
Ahn Ki Yung, 2017, ABS170510908 CORR ABS170510908 CORR
[4]  
Baelde D, 2007, LECT NOTES ARTIF INT, V4603, P391
[5]  
Baelde D, 2014, J FORMALIZ REASON, V7, P1
[6]   PSI-CALCULI: A FRAMEWORK FOR MOBILE PROCESSES WITH NOMINAL DATA AND LOGIC [J].
Bengtson, Jesper ;
Johansson, Magnus ;
Parrow, Joachim ;
Victor, Bjoern .
LOGICAL METHODS IN COMPUTER SCIENCE, 2011, 7 (01)
[7]   Open bisimulation, revisited [J].
Briais, Sebastien ;
Nestmann, Uwe .
THEORETICAL COMPUTER SCIENCE, 2007, 386 (03) :236-271
[8]  
Eriksson Lars-Henrik, 2020, MODEL LOGICS NOMINAL MODEL LOGICS NOMINAL
[9]   A Two-Level Logic Approach to Reasoning About Computations [J].
Gacek, Andrew ;
Miller, Dale ;
Nadathur, Gopalan .
JOURNAL OF AUTOMATED REASONING, 2012, 49 (02) :241-273
[10]   ALGEBRAIC LAWS FOR NONDETERMINISM AND CONCURRENCY [J].
HENNESSY, M ;
MILNER, R .
JOURNAL OF THE ACM, 1985, 32 (01) :137-161