Model Checking Parameterised Multi-token Systems via the Composition Method

DOI10.1007/978-3-319-40229-1_34zbMath1476.68144OpenAlexW2478478319MaRDI QIDQ2817946

Benjamin Aminof, Sasha Rubin

Publication date: 5 September 2016

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:3-3798

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Parameterized model checking of rendezvous systems ⋮ Verification of agent navigation in partially-known environments ⋮ An automata-theoretic approach to the verification of distributed algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic self-stabilization
• Reasoning about networks with many identical finite state processes
• Proving properties of a ring of finite-state machines
• The monadic theory of order
• Parameterized Model Checking of Token-Passing Systems
• On the Verification of Timed Ad Hoc Networks
• Parameterized Model Checking of Rendezvous Systems
• The first order properties of products of algebraic systems
• Liveness of Parameterized Timed Networks
• On the Expressive Power of Communication Primitives in Parameterised Systems
• Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
• Reasoning about systems with many processes
• Decidability of Parameterized Verification
• Branching-Depth Hierarchies
• On compositionality and its limitations
• Computer Science Logic
• CONCUR 2004 - Concurrency Theory
• On Reasoning About Rings

This page was built for publication: Model Checking Parameterised Multi-token Systems via the Composition Method