Muller message-passing automata and logics
type: Item
instance of: scholarly article
title: Muller message-passing automata and logics
zbMATH Open document ID: 1154.68064
author: Benedikt Bollig
author: Dietrich Kuske
published in: Information and Computation
publication date: 2008-10-08T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5349798
zbMATH Keywords: concurrency
zbMATH Keywords: Muller automata
zbMATH Keywords: message-passing automata
zbMATH Keywords: infinite message sequence charts
zbMATH Keywords: monadic second-order logic
MaRDI profile type: Publication
full work available at URL: j.ic.2008.03.010
OpenAlex ID: W1973172637
cites work: Message-passing automata are expressively equivalent to EMSO logic
cites work: On Communicating Finite-State Machines
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Theories of automata on \(\omega\)-tapes: a simplified approach
cites work: Deterministic asynchronous automata for infinite traces
cites work: Asynchronous cellular automata for pomsets
cites work: Logical definability on infinite traces
cites work: Decision Problems of Finite Automata Design and Related Arithmetics
cites work: Asynchronous cellular automata for infinite traces
cites work: A Kleene theorem and model checking algorithms for existentially bounded communicating automata
cites work: Q5551141
cites work: A theory of regular MSC languages
cites work: Regular sets of infinite message sequence charts
cites work: Elements of finite model theory.
cites work: Generalized quantifiers and well orderings
cites work: Q4714446
cites work: A generalization of Ehrenfeucht's game and some applications
DOI: 10.1016/J.IC.2008.03.010
description: scientific article; zbMATH DE number 5349798