Cargando…
Parameterized model checking of rendezvous systems
Parameterized model checking is the problem of deciding if a given formula holds irrespective of the number of participating processes. A standard approach for solving the parameterized model checking problem is to reduce it to model checking finitely many finite-state systems. This work considers t...
Autores principales: | Aminof, Benjamin, Kotek, Tomer, Rubin, Sasha, Spegni, Francesco, Veith, Helmut |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6560783/ https://www.ncbi.nlm.nih.gov/pubmed/31258231 http://dx.doi.org/10.1007/s00446-017-0302-6 |
Ejemplares similares
-
Pebble-Intervals Automata and FO[Formula: see text] with Two Orders
por: Labai, Nadia, et al.
Publicado: (2020) -
The Grand Rendezvous
Publicado: (1874) -
Para[Formula: see text] : parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
por: Konnov, Igor, et al.
Publicado: (2017) -
Rendezvous with Ada 95
por: Naiditch, David, et al.
Publicado: (1995) -
Rendezvous in distributed systems: theory, algorithms and applications
por: Gu, Zhaoquan, et al.
Publicado: (2017)