Caricamento...
Directed Reachability for Infinite-State Systems
Numerous tasks in program analysis and synthesis reduce to deciding reachability in possibly infinite graphs such as those induced by Petri nets. However, the Petri net reachability problem has recently been shown to require non-elementary time, which raises questions about the practical applicabili...
Salvato in:
| Pubblicato in: | Tools and Algorithms for the Construction and Analysis of Systems |
|---|---|
| Autori principali: | , , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
2021
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7984551/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-72013-1_1 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|