Pages that link to "Item:Q3657436"
From MaRDI portal
The following pages link to On Communicating Finite-State Machines (Q3657436):
Displaying 50 items.
- Relating two automata-based models of orchestration and choreography (Q272310) (← links)
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- On the diversity of asynchronous communication (Q315311) (← links)
- On deciding synchronizability for asynchronously communicating systems (Q344799) (← links)
- Orchestrated session compliance (Q347361) (← links)
- An interface theory for service-oriented design (Q407507) (← links)
- A generic framework for \(n\)-protocol compatibility checking (Q433347) (← links)
- Temporal logics for concurrent recursive programs: satisfiability and model checking (Q472794) (← links)
- Trace- and failure-based semantics for responsiveness (Q478516) (← links)
- Heterogeneous and asynchronous networks of timed systems (Q505453) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Testing for unboundedness of fifo channels (Q685434) (← links)
- Conversation protocols: a formalism for specification and verification of reactive electronic services (Q703491) (← links)
- Realizable temporal logics for web service choreography (Q739636) (← links)
- Realizable causal-consistent reversible choreographies for systems with first-in-first-out communication channels (Q780055) (← links)
- Timed hyperproperties (Q821560) (← links)
- Reachability problems on reliable and lossy queue automata (Q825976) (← links)
- Complexity of reachability problems for finite discrete dynamical systems (Q856411) (← links)
- Muller message-passing automata and logics (Q948076) (← links)
- An analytical model for end-to-end communication channel over PLCN based on QBDs (Q990086) (← links)
- A note on the attractor-property of infinite-state Markov chains (Q1045897) (← links)
- Exposure to deadlock for communicating processes is hard to detect (Q1064050) (← links)
- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines (Q1094140) (← links)
- On the analysis of cooperation and antagonism in networks of communicating processes (Q1098279) (← links)
- The complexity of reachability in distributed communicating processes (Q1098622) (← links)
- A methodology for constructing communication protocols with multiple concurrent functions (Q1112596) (← links)
- Resolution-based approach to compatibility analysis of interacting automata (Q1127549) (← links)
- Reduction and covering of infinite reachability trees (Q1173681) (← links)
- Tuning distributed control algorithms for optimal functioning (Q1187845) (← links)
- Communication for alternating machines (Q1203600) (← links)
- Verifying identical communicating processes is undecidable (Q1269916) (← links)
- Analysis of a class of communicating finite state machines (Q1323365) (← links)
- Verification in loosely synchronous queue-connected discrete timed automata. (Q1401187) (← links)
- Reachability problems for sequential dynamical systems with threshold functions. (Q1401231) (← links)
- Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
- Multiparty session types, beyond duality (Q1647963) (← links)
- Automated verification of automata communicating via FIFO and bag buffers (Q1650866) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- Simulating perfect channels with probabilistic lossy channels (Q1776399) (← links)
- A contracting model for flexible distributed scheduling (Q1815836) (← links)
- Boundedness, empty channel detection, and synchronization for communicating finite automata (Q1819939) (← links)
- Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078) (← links)
- Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355) (← links)
- Realizability of high-level message sequence charts: closing the gaps (Q1884911) (← links)
- On termination and invariance for faulty channel machines (Q1941874) (← links)
- Quasi-static scheduling of communicating tasks (Q1959479) (← links)
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations (Q1960526) (← links)
- Process calculi as a tool for studying coordination, contracts and session types (Q1987732) (← links)
- Composition and decomposition of multiparty sessions (Q1996856) (← links)
- A core model for choreographic programming (Q2007727) (← links)
