Reachability Problems [electronic resource] : 15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings /
Material type: TextSeries: Theoretical Computer Science and General Issues ; 13035Publisher: Cham : Springer International Publishing : Imprint: Springer, 2021Edition: 1st ed. 2021Description: XVIII, 165 p. 16 illus., 6 illus. in color. online resourceContent type:- text
- computer
- online resource
- 9783030897161
- 004.0151 23
- QA75.5-76.95
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 on this title.