A theory of regular MSC languages

DOI10.1016/J.IC.2004.08.004MaRDI QIDQ2573333zbMATH OpenOpenAlexFDO

Authors Yanyan Li, Jesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, Milind Sohoni, P. S. Thiagarajan

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

Message sequence chartsMessage-passing systemsMonadic second-order logicRealizabilityRegularitySynthesis

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Regular collections of message sequence charts (extended abstract)
• On message sequence graphs and finitely generated regular MSC languages
• Generalised regular MSC languages
• The theory of message sequence charts
• A further step towards a theory of regular MSC languages

Cites work

• A further step towards a theory of regular MSC languages
• An expressively complete linear time temporal logic for Mazurkiewicz traces
• Beyond message sequence graphs
• Bounded time-stamping in message-passing systems
• Generalised regular MSC languages
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Infinite-state high-level MSCs: Model-checking and realizability (extended abstract)
• Interpreting message flow graphs
• Logical definability on infinite traces
• LSCs: Breathing life into message sequence charts
• Message sequence graphs and decision problems on Marzurkiewicz traces
• Notes on finite asynchronous automata
• On message sequence graphs and finitely generated regular MSC languages
• Realizability and verification of MSC graphs
• Reasoning about sequential and branching behaviours of message sequence graphs
• Regular collections of message sequence charts (extended abstract)
• Semi-commutations
• Smart play-out of behavioral requirements
• Synthesizing distributed finite-state systems from MSCs
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(47)

• Realizability of concurrent recursive programs
• Bounded time-stamping in message-passing systems
• Regular sets of infinite message sequence charts
• Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
• Event clock message passing automata: a logical characterization and an emptiness checking algorithm
• Checking conformance for time-constrained scenario-based specifications
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• Message-passing automata are expressively equivalent to EMSO logic
• MSCPDL -- a language for behavioural abstraction
• On message sequence graphs and finitely generated regular MSC languages
• On regular message sequence chart languages and relationships to Mazurkiewicz trace theory
• Timed semantics of message sequence charts based on timed automata
• A calculus of global interaction based on session types
• Automata and Logics for Concurrent Systems: Five Models in Five Pages
• Shared-memory systems and charts
• Pattern matching and membership for hierarchical message sequence charts
• Distributed Asynchronous Automata
• On Distributed Monitoring and Synthesis
• Communicating finite-state machines and two-variable logic
• Automated synthesis of distributed controllers
• Solving problems on graphs of high rank-width
• MSO Logic for Unambiguous Shared-Memory Systems
• Semantics of Deterministic Shared-Memory Systems
• Mixing Lossy and Perfect Fifo Channels
• Realizability of Dynamic MSC Languages
• Unambiguous shared-memory systems
• Realizability of Concurrent Recursive Programs
• Pomset Languages of Finite Step Transition Systems
• A quadratic construction for Zielonka automata with acyclic communication structure
• Regular set of representatives for time-constrained MSC graphs
• Regular collections of message sequence charts (extended abstract)
• Synthesizing distributed finite-state systems from MSCs
• A further step towards a theory of regular MSC languages
• Generalised regular MSC languages
• The theory of message sequence charts
• It is easy to be wise after the event: communicating finite-state machines capture first-order logic with ``happened before
• Exhibition of a structural bug with wings
• Synthesis of Safe Message-Passing Systems
• Automata and Logics for Timed Message Sequence Charts
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Compositional synthesis of asynchronous automata
• Synthesis and Analysis of Petri Nets from Causal Specifications
• On synthesis of distributed monitors (invited talk)
• On the send-synchronizability problem for mailbox communication
• Causal message sequence charts
• Pattern matching and membership for hierarchical message sequence charts
• Muller message-passing automata and logics

This page was built for publication: A theory of regular MSC languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573333)