Reachability Problems [electronic resource] : 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings / edited by Paul C. Bell, Patrick Totzke, Igor Potapov.
Contributor(s): Bell, Paul C [editor.]
| Totzke, Patrick [editor.]
| Potapov, Igor [editor.]
| SpringerLink (Online service)
.
Material type: 









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.-.
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.
There are no comments for this item.