Abstract
We survey some results on the automatic verification of parameterized programs without identities. These are systems composed of arbitrarily many components, all of them running exactly the same finite-state program. We discuss the complexity of deciding that no component reaches an unsafe state. The note is addressed at theoretical computer scientists in general.
| Original language | English |
|---|---|
| Title of host publication | 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 |
| Editors | Ernst W. Mayr, Natacha Portier |
| Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| Pages | 1-10 |
| Number of pages | 10 |
| Volume | 25 |
| ISBN (Electronic) | 9783939897651 |
| DOIs | |
| State | Published - 1 Mar 2014 |
| Event | 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 - Lyon, France Duration: 5 Mar 2014 → 8 Mar 2014 |
Conference
| Conference | 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 |
|---|---|
| Country/Territory | France |
| City | Lyon |
| Period | 5/03/14 → 8/03/14 |
Keywords
- Automata theory
- Parameterized verification
Fingerprint
Dive into the research topics of 'Keeping a crowd safe: On the complexity of parameterized verification'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver