Reachability Problems

Reachability Problems

15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings

Bell, Paul C.; Potapov, Igor; Totzke, Patrick

Springer Nature Switzerland AG

10/2021

165

Mole

Inglês

9783030897154

15 a 20 dias

296

Descrição não disponível.
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.-
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
architecture verification and validation;artificial intelligence;automata theory;computational game theory;computational linguistics;computational models;embedded systems;formal languages;formal logic;graph theory;infinite state systems;model checking;petri nets;software architecture;software design;software engineering;software evaluation;theoretical computer science;verification