Pages that link to "Item:Q3657436"
From MaRDI portal
The following pages link to On Communicating Finite-State Machines (Q3657436):
Displaying 50 items.
- Quantifying the Discord: Order Discrepancies in Message Sequence Charts (Q3510808) (← links)
- On the Computational Capacity of Parallel Communicating Finite Automata (Q3533006) (← links)
- Mixing Lossy and Perfect Fifo Channels (Q3541029) (← links)
- QUANTIFYING THE DISCORD: ORDER DISCREPANCIES IN MESSAGE SEQUENCE CHARTS (Q3552521) (← links)
- Analysis of Realizability Conditions for Web Service Choreographies (Q3613058) (← links)
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness (Q3613069) (← links)
- On Communicating Finite-State Machines (Q3657436) (← links)
- Boundedness, hierarchy of fairness, and communication networks with delay (Q4207557) (← links)
- (Q4520835) (← links)
- The inclusion structure of partially lossy queue monoids and their trace submonoids (Q4553833) (← links)
- Reasoning about knowledge and messages in asynchronous multi-agent systems (Q4559603) (← links)
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations (Q4571986) (← links)
- (Q4600773) (← links)
- Undecidable verification problems for programs with unreliable channels (Q4632436) (← links)
- Distributed Control of Discrete-Event Systems: A First Step (Q4909348) (← links)
- Model-checking Timed Temporal Logics (Q4982129) (← links)
- (Q5009419) (← links)
- (Q5009453) (← links)
- Progress-preserving Refinements of CTA (Q5009458) (← links)
- Multi-buffer simulations for trace language inclusion (Q5015280) (← links)
- (Q5019694) (← links)
- (Q5020648) (← links)
- (Q5028474) (← links)
- Event-B-Supported Choreography-Defined Communicating Systems (Q5040369) (← links)
- Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types (Q5041094) (← links)
- Rational, recognizable, and aperiodic partially lossy queue languages (Q5075703) (← links)
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms (Q5089316) (← links)
- (Q5090942) (← links)
- Synchronizability of communicating finite state machines is not decidable (Q5111454) (← links)
- (Q5129947) (← links)
- Diagnosis of Deep Discrete-Event Systems (Q5145832) (← links)
- Agent-Based Modeling, Mathematical Formalism for (Q5150305) (← links)
- Assembly Theories for Communication-Safe Component Systems (Q5170748) (← links)
- Automata and Logics for Timed Message Sequence Charts (Q5458842) (← links)
- Propositional Dynamic Logic for Message-Passing Systems (Q5458843) (← links)
- Global progress for dynamically interleaved multiparty sessions (Q5741563) (← links)
- (Q5856424) (← links)
- Verification of Flat FIFO Systems (Q5875373) (← links)
- A Sound Algorithm for Asynchronous Session Subtyping (Q5875400) (← links)
- Precise Subtyping for Asynchronous Multiparty Sessions (Q5886521) (← links)
- Well-structured transition systems everywhere! (Q5941101) (← links)
- Composition of synchronous communicating systems (Q6052940) (← links)
- Guessing the Buffer Bound for k-Synchronizability (Q6070755) (← links)
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality (Q6095497) (← links)
- On Composing Communicating Systems (Q6122641) (← links)
- A Theory of Formal Choreographic Languages (Q6135778) (← links)
- A model of actors and grey failures (Q6137831) (← links)
- Branching pomsets: design, expressiveness and applications to choreographies (Q6151606) (← links)
- Asynchronous communicating cellular automata: formalization, robustness and equivalence (Q6154787) (← links)
- Complete multiparty session type projection with automata (Q6535693) (← links)
