Rule Formats for Nominal Process CalculiArticleAuthors: Luca Aceto ; Ignacio Fábregas

; Álvaro García-Pérez

; Anna Ingólfsdóttir ; Yolanda Ortega-Mallén
NULL##0000-0002-3045-4180##0000-0002-9558-6037##NULL##NULL
Luca Aceto;Ignacio Fábregas;Álvaro García-Pérez;Anna Ingólfsdóttir;Yolanda Ortega-Mallén
The nominal transition systems (NTSs) of Parrow et al. describe the operational semantics of nominal process calculi. We study NTSs in terms of the nominal residual transition systems (NRTSs) that we introduce. We provide rule formats for the specifications of NRTSs that ensure that the associated NRTS is an NTS and apply them to the operational specifications of the early and late pi-calculus. We also explore alternative specifications of the NTSs in which we allow residuals of abstraction sort, and introduce translations between the systems with and without residuals of abstraction sort. Our study stems from the Nominal SOS of Cimini et al. and from earlier works in nominal sets and nominal logic by Gabbay, Pitts and their collaborators.
Volume: Volume 15, Issue 4
Secondary volumes: Selected Papers of the 28th International Conference on Concurrency Theory (CONCUR 2017)
Published on: October 14, 2019
Accepted on: August 19, 2019
Submitted on: July 10, 2018
Keywords: Computer Science - Logic in Computer Science, Computer Science - Programming Languages
Funding:
Source : OpenAIRE Graph- Type and Proof Structures for Concurrent Software Verification; Funder: European Commission; Code: 724464
- A Rigorous Approach to Consistency in Cloud Databases; Funder: European Commission; Code: 714729