Parameterized model checking of rendezvous systems
From MaRDI portal
Publication:1635829
DOI10.1007/s00446-017-0302-6zbMath1451.68165OpenAlexW2757433671WikidataQ59605462 ScholiaQ59605462MaRDI QIDQ1635829
Sasha Rubin, Tomer Kotek, Benjamin Aminof, Helmut Veith, Francesco Spegni
Publication date: 1 June 2018
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-017-0302-6
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Structural Invariants for the Verification of Systems with Parameterized Architectures, Verification of agent navigation in partially-known environments, Modelling Uncertainty in Architectures of Parametric Component-Based Systems, Parameterized model checking of networks of timed automata with Boolean guards, Checking deadlock-freedom of parametric component-based systems, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithmic uses of the Feferman-Vaught theorem
- A lower bound technique for the size of nondeterministic finite automata
- Elements of finite model theory.
- Reasoning about networks with many identical finite state processes
- Automata-theoretic techniques for modal logics of programs
- Proving properties of a ring of finite-state machines
- The computational power of population protocols
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Parameterized model checking of networks of timed automata with Boolean guards
- Parametrized complexity theory.
- Tight Cutoffs for Guarded Protocols with Fairness
- Model Checking Parameterised Multi-token Systems via the Composition Method
- The Power of Well-Structured Systems
- Parameterized Synthesis
- Towards Efficient Parameterized Synthesis
- Parameterized Model Checking of Token-Passing Systems
- Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
- The Specker-Blatter Theorem Revisited
- Parameterized Model Checking of Rendezvous Systems
- Liveness of Parameterized Timed Networks
- On the Expressive Power of Communication Primitives in Parameterised Systems
- The complexity of propositional linear temporal logics
- Reasoning about systems with many processes
- Decidability of Parameterized Verification
- Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks
- Branching-Depth Hierarchies
- Parameterized Verification of Broadcast Networks of Register Automata
- Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms
- Computer Science Logic
- CONCUR 2004 - Concurrency Theory
- Verification of Population Protocols
- Linear Recurrence Relations for Graph Polynomials
- On Reasoning About Rings
- Correct Hardware Design and Verification Methods
