A theory of regular MSC languages

DOI10.1016/j.ic.2004.08.004zbMath1101.68656OpenAlexW2166159524MaRDI QIDQ2573333

Yanyan Li

Publication date: 7 November 2005

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

Full work available at URL: https://doi.org/10.1016/j.ic.2004.08.004

zbMATH Keywords

Monadic second-order logicRealizabilityRegularityMessage sequence chartsSynthesisMessage-passing systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Realizability of concurrent recursive programs ⋮ Automated Synthesis of Distributed Controllers ⋮ Solving Problems on Graphs of High Rank-Width ⋮ Causal message sequence charts ⋮ Distributed Asynchronous Automata ⋮ On Distributed Monitoring and Synthesis ⋮ Communicating Finite-State Machines and Two-Variable Logic ⋮ Automata and Logics for Concurrent Systems: Five Models in Five Pages ⋮ A quadratic construction for Zielonka automata with acyclic communication structure ⋮ Unnamed Item ⋮ Regular set of representatives for time-constrained MSC graphs ⋮ 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 ⋮ Mixing Lossy and Perfect Fifo Channels ⋮ Shared-Memory Systems and Charts ⋮ Muller message-passing automata and logics ⋮ Event clock message passing automata: a logical characterization and an emptiness checking algorithm ⋮ Exhibition of a Structural Bug with Wings ⋮ UNAMBIGUOUS SHARED-MEMORY SYSTEMS ⋮ Compositional synthesis of asynchronous automata ⋮ A Kleene theorem and model checking algorithms for existentially bounded communicating automata ⋮ Message-passing automata are expressively equivalent to EMSO logic ⋮ Realizability of Concurrent Recursive Programs ⋮ Synthesis of Safe Message-Passing Systems ⋮ Automata and Logics for Timed Message Sequence Charts ⋮ Pomset Languages of Finite Step Transition Systems ⋮ Timed Semantics of Message Sequence Charts Based on Timed Automata ⋮ Bounded time-stamping in message-passing systems ⋮ A Calculus of Global Interaction based on Session Types ⋮ 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
• Logical definability on infinite traces
• Semi-commutations
• Bounded time-stamping in message-passing systems
• Interpreting message flow graphs
• An expressively complete linear time temporal logic for Mazurkiewicz traces
• Weak Second‐Order Arithmetic and Finite Automata
• Notes on finite asynchronous automata
• LSCs: Breathing life into message sequence charts