A Theory of Formal Choreographic Languages

IF 0.6 4区数学 Q4 COMPUTER SCIENCE, THEORY & METHODS

Logical Methods in Computer Science Pub Date : 2023-08-02 DOI:10.46298/lmcs-19(3:9)2023

Franco Barbanera, Ivan Lanese, Emilio Tuosto

引用次数: 0

Abstract

We introduce a meta-model based on formal languages, dubbed formal choreographic languages, to study message-passing systems. Our framework allows us to generalise standard constructions from the literature and to compare them. In particular, we consider notions such as global view, local view, and projections from the former to the latter. The correctness of local views projected from global views is characterised in terms of a closure property. We consider a number of communication properties -- such as (dead)lock-freedom -- and give conditions on formal choreographic languages to guarantee them. Finally, we show how formal choreographic languages can capture existing formalisms; specifically we consider communicating finite-state machines, choreography automata, and multiparty session types. Notably, formal choreographic languages, differently from most approaches in the literature, can naturally model systems exhibiting non-regular behaviour.

查看原文本刊更多论文

形式舞蹈语言理论

我们引入了一个基于形式语言(称为形式编排语言)的元模型来研究消息传递系统。我们的框架允许我们从文献中概括出标准结构，并对它们进行比较。特别是，我们考虑诸如全局视图、局部视图以及从前者到后者的投影之类的概念。从全局视图投射的局部视图的正确性以闭包属性为特征。我们考虑了许多通信属性——比如(死)锁自由——并给出了形式编排语言的条件来保证它们。最后，我们展示了形式编排语言如何捕获现有的形式主义;具体来说，我们考虑通信有限状态机、编排自动机和多方会话类型。值得注意的是，与文献中的大多数方法不同，形式编排语言可以自然地对表现出非规则行为的系统进行建模。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Logical Methods in Computer Science 工程技术-计算机：理论方法

CiteScore

1.80

自引率

0.00%

发文量

105

审稿时长

6-12 weeks

期刊介绍： Logical Methods in Computer Science is a fully refereed, open access, free, electronic journal. It welcomes papers on theoretical and practical areas in computer science involving logical methods, taken in a broad sense; some particular areas within its scope are listed below. Papers are refereed in the traditional way, with two or more referees per paper. Copyright is retained by the author. Topics of Logical Methods in Computer Science: Algebraic methods Automata and logic Automated deduction Categorical models and logic Coalgebraic methods Computability and Logic Computer-aided verification Concurrency theory Constraint programming Cyber-physical systems Database theory Defeasible reasoning Domain theory Emerging topics: Computational systems in biology Emerging topics: Quantum computation and logic Finite model theory Formalized mathematics Functional programming and lambda calculus Inductive logic and learning Interactive proof checking Logic and algorithms Logic and complexity Logic and games Logic and probability Logic for knowledge representation Logic programming Logics of programs Modal and temporal logics Program analysis and type checking Program development and specification Proof complexity Real time and hybrid systems Reasoning about actions and planning Satisfiability Security Semantics of programming languages Term rewriting and equational logic Type theory and constructive mathematics.