A counter abstraction technique for verifying properties of probabilistic swarm systems (Q2124442): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2022.103666 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2022.103666 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4207049699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of structural stationarity in the \(\pi\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4794460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Parameterized Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Model Checking of Token-Passing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterised verification for multi-agent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Model Checking Landscape / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Verification of Concurrent Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking for probabilistic timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking and abstraction to the aid of parameterized systems (a survey) / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2004 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Demystifying Reachability in Vector Addition Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized model checking of networks of timed automata with Boolean guards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications and Theory of Petri Nets 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of Timed-Arc Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation in networks of passively mobile finite-state sensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stably computable predicates are semilinear / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of population protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying Team Formation Protocols with Probabilistic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry Reduction for Probabilistic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-valued abstraction for probabilistic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Probabilistic Abstraction Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Abstraction of Probabilistic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inductive Technique for Parameterised Model Checking of Degenerative Distributed Randomised Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2963938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2022.103666 / rank
 
Normal rank

Latest revision as of 03:41, 17 December 2024

scientific article
Language Label Description Also known as
English
A counter abstraction technique for verifying properties of probabilistic swarm systems
scientific article

    Statements

    A counter abstraction technique for verifying properties of probabilistic swarm systems (English)
    0 references
    0 references
    11 April 2022
    0 references
    probabilistic model checking
    0 references
    parameterised verification
    0 references
    swarm robotics
    0 references
    multi-agent systems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers