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