A theory of regular MSC languages
From MaRDI portal
Publication:2573333
DOI10.1016/J.IC.2004.08.004zbMATH Open1101.68656OpenAlexW2166159524MaRDI QIDQ2573333FDOQ2573333
Authors: 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
Recommendations
Monadic second-order logicRegularityRealizabilityMessage sequence chartsSynthesisMessage-passing systems
Cites Work
- Title not available (Why is that?)
- An expressively complete linear time temporal logic for Mazurkiewicz traces
- Weak Second‐Order Arithmetic and Finite Automata
- Notes on finite asynchronous automata
- Logical definability on infinite traces
- Title not available (Why is that?)
- Semi-commutations
- Title not available (Why is that?)
- LSCs: Breathing life into message sequence charts
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interpreting message flow graphs
- Title not available (Why is that?)
- Bounded time-stamping in message-passing systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (45)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- Bounded time-stamping in message-passing systems
- Title not available (Why is that?)
- A quadratic construction for Zielonka automata with acyclic communication structure
- Title not available (Why is that?)
- MSCPDL -- a language for behavioural abstraction
- Pomset Languages of Finite Step Transition Systems
- Automated synthesis of distributed controllers
- Compositional synthesis of asynchronous automata
- Realizability of Concurrent Recursive Programs
- The theory of message sequence charts
- Muller message-passing automata and logics
- Regular set of representatives for time-constrained MSC graphs
- Checking conformance for time-constrained scenario-based specifications
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm
- Automata and Logics for Concurrent Systems: Five Models in Five Pages
- Regular sets of infinite message sequence charts
- Automata and Logics for Timed Message Sequence Charts
- Realizability of Dynamic MSC Languages
- Unambiguous shared-memory systems
- Shared-memory systems and charts
- Title not available (Why is that?)
- MSO Logic for Unambiguous Shared-Memory Systems
- Synthesis and Analysis of Petri Nets from Causal Specifications
- Solving problems on graphs of high rank-width
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- Title not available (Why is that?)
- Message-passing automata are expressively equivalent to EMSO logic
- Title not available (Why is that?)
- Distributed Asynchronous Automata
- Timed semantics of message sequence charts based on timed automata
- Causal message sequence charts
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Pattern matching and membership for hierarchical message sequence charts
- It is easy to be wise after the event: communicating finite-state machines capture first-order logic with ``happened before
- On Distributed Monitoring and Synthesis
- A calculus of global interaction based on session types
- Realizability of concurrent recursive programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semantics of Deterministic Shared-Memory Systems
- Communicating finite-state machines and two-variable logic
- Exhibition of a structural bug with wings
- Synthesis of Safe Message-Passing Systems
- Mixing Lossy and Perfect Fifo Channels
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)
