Reachability Problems 15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings /
Reachability Problems 15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings / [electronic resource] :
edited by Paul C. Bell, Patrick Totzke, Igor Potapov.
- 1st ed. 2021.
- XVIII, 165 p. 16 illus., 6 illus. in color. online resource.
- Theoretical Computer Science and General Issues, 13035 2512-2029 ; .
- Theoretical Computer Science and General Issues, 13035 .
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.
9783030897161
10.1007/978-3-030-89716-1 doi
Computer science.
Artificial intelligence.
Software engineering.
Computer engineering.
Computer networks .
Theory of Computation.
Artificial Intelligence.
Software Engineering.
Computer Engineering and Networks.
QA75.5-76.95
004.0151
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.
9783030897161
10.1007/978-3-030-89716-1 doi
Computer science.
Artificial intelligence.
Software engineering.
Computer engineering.
Computer networks .
Theory of Computation.
Artificial Intelligence.
Software Engineering.
Computer Engineering and Networks.
QA75.5-76.95
004.0151