Parameterized model checking of rendezvous systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1614699 (Why is no real title available?)
- scientific article; zbMATH DE number 1302047 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 2080048 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- scientific article; zbMATH DE number 1392309 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- A lower bound technique for the size of nondeterministic finite automata
- Algorithmic uses of the Feferman-Vaught theorem
- Automata-theoretic techniques for modal logics of programs
- Branching-depth hierarchies
- CONCUR 2004 - Concurrency Theory
- Computer Science Logic
- Decidability and complexity results for verification of asynchronous broadcast networks
- Decidability of parameterized verification
- Elements of finite model theory.
- Exact and efficient verification of parameterized cache coherence protocols
- Graph structure and monadic second-order logic. A language-theoretic approach
- Keeping a crowd safe: on the complexity of parameterized verification (invited talk)
- Linear Recurrence Relations for Graph Polynomials
- Linear time solvable optimization problems on graphs of bounded clique-width
- Liveness of parameterized timed networks
- Model checking parameterised multi-token systems via the composition method
- On Reasoning About Rings
- On the Expressive Power of Communication Primitives in Parameterised Systems
- Parameterized Model Checking of Token-Passing Systems
- Parameterized model checking of networks of timed automata with Boolean guards
- Parameterized model checking of rendezvous systems
- Parameterized synthesis
- Parameterized verification of broadcast networks of register automata
- Parametrized complexity theory.
- 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 Specker-Blatter theorem revisited
- The complexity of propositional linear temporal logics
- The computational power of population protocols
- The power of well-structured systems
- Tight cutoffs for guarded protocols with fairness
- Towards efficient parameterized synthesis
- Tutorial on parameterized model checking of fault-tolerant distributed algorithms
- Upper bounds to the clique width of graphs
- Verification of Population Protocols
Cited in
(15)- scientific article; zbMATH DE number 1614699 (Why is no real title available?)
- scientific article; zbMATH DE number 2080053 (Why is no real title available?)
- Decidability of parameterized verification
- Checking deadlock-freedom of parametric component-based systems
- Parameterized model checking of rendezvous systems
- Tight cutoffs for guarded protocols with fairness
- Model checking parameterised multi-token systems via the composition method
- Verification of agent navigation in partially-known environments
- Parameterized model checking of networks of timed automata with Boolean guards
- Computer Science Logic
- Parameterized compositional model checking
- Modelling Uncertainty in Architectures of Parametric Component-Based Systems
- scientific article; zbMATH DE number 2086592 (Why is no real title available?)
- Structural Invariants for the Verification of Systems with Parameterized Architectures
- scientific article; zbMATH DE number 7559502 (Why is no real title available?)
This page was built for publication: Parameterized model checking of rendezvous systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1635829)
