|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910506406003321 |
|
|
Titolo |
Reachability Problems : 15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings / / edited by Paul C. Bell, Patrick Totzke, Igor Potapov |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2021.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (181 pages) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 13035 |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science |
Artificial intelligence |
Software engineering |
Computer engineering |
Computer networks |
Theory of Computation |
Artificial Intelligence |
Software Engineering |
Computer Engineering and Networks |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di contenuto |
|
Invited Papers -- Quantitative vs. Weighted Automata -- Theorem Proving Using Clausal Resolution: From Past to Present -- Population Protocols: Beyond Runtime Analysis -- Recent Advances on Reachability Problems for Valence Systems (Invited Talk) -- Regular Papers -- Improvements in Unfolding of Colored Petri Nets -- Reachability of weakly nonlinear systems using Carleman linearization -- Continued Fraction approach to Gauss-Reduction theory -- Absent Subsequences in Words -- Minimal Number of Calls in Propositional Protocols -- Reachability Is NP-Complete Even for the Simplest Neural Networks.-. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
Chapter ‘Recent Advances on Reachability Problems for Valence Systems’ is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com. |
|
|
|
|
|
|
|