A counter abstraction technique for verifying properties of probabilistic swarm systems
From MaRDI portal
Publication:2124442
DOI10.1016/j.artint.2022.103666OpenAlexW4207049699MaRDI QIDQ2124442
Publication date: 11 April 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103666
Uses Software
Cites Work
- Parameterised verification for multi-agent systems
- Three-valued abstraction for probabilistic systems
- Verification of population protocols
- A theory of structural stationarity in the \(\pi\)-calculus
- The covering and boundedness problems for vector addition systems
- Model checking and abstraction to the aid of parameterized systems (a survey)
- Parameterized model checking of networks of timed automata with Boolean guards
- Model checking for probabilistic timed automata
- Semigroups, Presburger formulas, and languages
- An Inductive Technique for Parameterised Model Checking of Degenerative Distributed Randomised Protocols
- On Abstraction of Probabilistic Systems
- Parameterized Model Checking of Token-Passing Systems
- Verification of Timed-Arc Petri Nets
- Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems
- Stochastic Model Checking
- Verifying Team Formation Protocols with Probabilistic Model Checking
- Decidability of Parameterized Verification
- Demystifying Reachability in Vector Addition Systems
- The Probabilistic Model Checking Landscape
- Variable Probabilistic Abstraction Refinement
- Stably computable predicates are semilinear
- CONCUR 2004 - Concurrency Theory
- Computation in networks of passively mobile finite-state sensors
- Applications and Theory of Petri Nets 2004
- Symmetry Reduction for Probabilistic Model Checking
- Automated Verification of Concurrent Stochastic Games
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
