Regular sets of infinite message sequence charts

DOI10.1016/S0890-5401(03)00123-8zbMath1082.68056MaRDI QIDQ1887140

Dietrich Kuske

Publication date: 23 November 2004

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

Mazurkiewicz tracesMonadic second-order logicMessage sequence chartsDistributed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (13)

Realizability of concurrent recursive programs ⋮ Causal message sequence charts ⋮ Communicating Finite-State Machines and Two-Variable Logic ⋮ Unnamed Item ⋮ Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic ⋮ MSO Logic for Unambiguous Shared-Memory Systems ⋮ Semantics of Deterministic Shared-Memory Systems ⋮ Muller message-passing automata and logics ⋮ A Kleene theorem and model checking algorithms for existentially bounded communicating automata ⋮ Message-passing automata are expressively equivalent to EMSO logic ⋮ Synthesis of Safe Message-Passing Systems ⋮ The recognizability of sets of graphs is a robust property ⋮ Checking conformance for time-constrained scenario-based specifications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Logical definability on infinite traces
• Asynchronous mappings and asynchronous cellular automata
• Combinatorics on traces
• Monadic second-order definable graph transductions: a survey
• Deterministic asynchronous automata for infinite traces
• Asynchronous cellular automata for pomsets
• Regular languages defined with generalized quantifiers
• An expressively complete linear time temporal logic for Mazurkiewicz traces
• Weak Second‐Order Arithmetic and Finite Automata
• The monadic second-order logic of graphs, II: Infinite graphs of bounded width
• An extension of the notions of traces and of asynchronous automata
• Application of model theoretic games to discrete linear orders and finite automata
• Asynchronous cellular automata for pomsets without auto-concurrency

This page was built for publication: Regular sets of infinite message sequence charts