Model checking parameterised multi-token systems via the composition method
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1956578 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Branching-depth hierarchies
- CONCUR 2004 - Concurrency Theory
- Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
- Computer Science Logic
- Decidability of parameterized verification
- Liveness of parameterized timed networks
- Mobile agents in distributed computing: network exploration
- On Reasoning About Rings
- On compositionality and its limitations
- On the Expressive Power of Communication Primitives in Parameterised Systems
- On the Verification of Timed Ad Hoc Networks
- Parameterized Model Checking of Token-Passing Systems
- Parameterized model checking of rendezvous systems
- Probabilistic self-stabilization
- Proving properties of a ring of finite-state machines
- Reasoning about networks with many identical finite state processes
- Reasoning about systems with many processes
- The first order properties of products of algebraic systems
- The monadic theory of order
Cited in
(7)- Parameterized model-checking of discrete-timed networks and symmetric-broadcast systems
- scientific article; zbMATH DE number 1796142 (Why is no real title available?)
- Parameterized model checking of rendezvous systems
- Verification of agent navigation in partially-known environments
- Parameterized Model Checking of Token-Passing Systems
- Automatic WSTS-based repair and deadlock detection of parameterized systems
- An automata-theoretic approach to the verification of distributed algorithms
This page was built for publication: Model checking parameterised multi-token systems via the composition method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817946)