user

Communicating Finite-State Machines and Two-Variable Logic

被引：1
|
作者：
Bollig, Benedikt [1 ,2 ]
Fortin, Marie [1 ,2 ]
Gastin, Paul [1 ,2 ]
机构：
[1] Univ Paris Saclay, LSV, CNRS, Paris, France
[2] Univ Paris Saclay, ENS Paris Saclay, Paris, France
来源：
35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018) | 2018年 / 96卷
关键词：
Communicating Finite-state Machines; MSO logic; Message Sequence Charts; AUTOMATA;
D O I：
10.4230/LIPIcs.STACS.2018.17
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Communicating finite-state machines are a fundamental, well-studied model of finite-state processes that communicate via unbounded first-in first-out channels. We show that they are expressively equivalent to existential MSO logic with two first-order variables and the order relation.
引用
收藏
页数：14
相关论文
共 50 条
  • [1] ON COMMUNICATING FINITE-STATE MACHINES
    BRAND, D
    ZAFIROPULO, P
    JOURNAL OF THE ACM, 1983, 30 (02) : 323 - 342
  • [2] SPECIFICATION AND SYNTHESIS OF COMMUNICATING FINITE-STATE MACHINES
    BELHADJ, H
    GERBAUX, L
    BERTRAND, MC
    SAUCIER, G
    IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1993, 22 : 91 - 102
  • [3] UNBOUNDEDNESS DETECTION FOR A CLASS OF COMMUNICATING FINITE-STATE MACHINES
    YU, YT
    GOUDA, MG
    INFORMATION PROCESSING LETTERS, 1983, 17 (05) : 235 - 240
  • [4] Complexity of Two-Variable Logic on Finite Trees
    Benaim, Saguy
    Benedikt, Michael
    Charatonik, Witold
    Kieronski, Emanuel
    Lenhardt, Rastislav
    Mazowiecki, Filip
    Worrell, James
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2016, 17 (04)
  • [5] Complexity of Two-Variable Logic on Finite Trees
    Benaim, Saguy
    Benedikt, Michael
    Charatonik, Witold
    Kieronski, Emanuel
    Lenhardt, Rastislav
    Mazowiecki, Filip
    Worrell, James
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2013, 7966 : 74 - 88
  • [6] Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
    Bollig, Benedikt
    Fortin, Marie
    Gastin, Paul
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021, 115 : 22 - 53
  • [7] EXPERIMENTS IN DATA-FLOW ANALYSIS OF COMMUNICATING FINITE-STATE MACHINES
    IYER, SP
    FORMAL DESCRIPTION TECHNIQUES, VI, 1994, 22 : 141 - 153
  • [8] Logic Locking of Finite-State Machines Using Transition Obfuscation
    Muzaffar, Shahzad
    Elfadel, Ibrahim M.
    PROCEEDINGS OF THE 2022 IFIP/IEEE 30TH INTERNATIONAL CONFERENCE ON VERY LARGE SCALE INTEGRATION (VLSI-SOC), 2022,
  • [9] IN FINITE-STATE MACHINES, LIVING MACHINES
    KRUGER, T
    ARCHITECTURAL DESIGN, 1994, (111) : R14 - R15
  • [10] A UNIFIED APPROACH TO THE DEADLOCK DETECTION PROBLEM IN NETWORKS OF COMMUNICATING FINITE-STATE MACHINES
    PENG, WX
    PURUSHOTHAMAN, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 531 : 243 - 252
12345