Pages that link to "Item:Q1923094"
From MaRDI portal
The following pages link to Verifying programs with unreliable channels (Q1923094):
Displaying 36 items.
- Parameterized Verification of Communicating Automata under Context Bounds (Q3447694) (← links)
- Monotonic Abstraction for Programs with Dynamic Memory Heaps (Q3512503) (← links)
- Mixing Lossy and Perfect Fifo Channels (Q3541029) (← links)
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems (Q3541030) (← links)
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness (Q3613069) (← links)
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations (Q3618568) (← links)
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication (Q3636840) (← links)
- The inclusion structure of partially lossy queue monoids and their trace submonoids (Q4553833) (← links)
- Refinement-Based Verification of Communicating Unstructured Code (Q4571128) (← links)
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations (Q4571986) (← links)
- Deciding properties of integral relational automata (Q4632414) (← links)
- Undecidable verification problems for programs with unreliable channels (Q4632436) (← links)
- The Two-Phase Commitment Protocol in an Extended π-Calculus (Q4917025) (← links)
- Monotonic Abstraction in Parameterized Verification (Q4982082) (← links)
- Rational, recognizable, and aperiodic partially lossy queue languages (Q5075703) (← links)
- (Q5090942) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
- Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms (Q5175774) (← links)
- View abstraction -- a tutorial (invited paper) (Q5240148) (← links)
- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols (Q5458318) (← links)
- Stochastic Games with Lossy Channels (Q5458349) (← links)
- The ω-Regular Post Embedding Problem (Q5458353) (← links)
- Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems (Q5458840) (← links)
- Monotonic Abstraction in Action (Q5505593) (← links)
- (Q5856424) (← links)
- A Sound Algorithm for Asynchronous Session Subtyping (Q5875400) (← links)
- Model checking parameterized asynchronous shared-memory systems (Q5892422) (← links)
- Well-structured transition systems everywhere! (Q5941101) (← links)
- Ensuring completeness of symbolic verification methods for infinite-state systems (Q5941104) (← links)
- Guessing the Buffer Bound for k-Synchronizability (Q6070755) (← links)
- Formal verification for event stream processing: model checking of BeepBeep stream processing pipelines (Q6116186) (← links)
- Existential Definability over the Subword Ordering (Q6178718) (← links)
- On the complexity of the linear-time μ-calculus for Petri Nets (Q6487371) (← links)
- Parameterized broadcast networks with registers: from NP to the frontiers of decidability (Q6629529) (← links)
- On the satisfiability of context-free string constraints with subword-ordering (Q6649435) (← links)
- Towards generalised half-duplex systems (Q6649540) (← links)