東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Reachability problems = 17th Interna...

International Conference on Reachability Problems (2023 :)

FindBook

Google Book

Amazon

博客來

Reachability problems = 17th International Conference, RP 2023, Nice, France, October 11-13, 2023 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Reachability problems/ edited by Olivier Bournez, Enrico Formenti, Igor Potapov.
其他題名:	17th International Conference, RP 2023, Nice, France, October 11-13, 2023 : proceedings /
其他題名:	RP 2023
其他作者:	Bournez, Olivier.
團體作者:	International Conference on Reachability Problems
出版者:	Cham :Springer Nature Switzerland : : 2023.,
面頁冊數:	xlviii, 199 p. :ill. (some col.), digital ;24 cm.
內容註:	Invited Papers -- Randomness quality and trade-offs for CA random string generators -- Regular Papers -- Complexity of Reachability Problems in Neural Networks -- Weakly synchronous systems with three machines are Turing powerful -- On the Identity and Group Problems for Complex Heisenberg Matrices -- Reachability analysis of a class of hybrid gene regulatory networks -- Quantitative Reachability Stackelberg-Pareto Synthesis -- Multi-Weighted Reachability Games -- On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions -- Adaptive Directions for Bernstein-based Polynomial Set Evolution -- Introducing Divergence for Infinite Probabilistic Models -- A Framework for the Competitive Analysis of Model Predictive Controllers -- Matching Patterns with Variables Under Simon's Congruence -- HyperMonitor: A Python Prototype for Hyper Predictive Runtime Verification -- Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs.
Contained By:	Springer Nature eBook
標題:	Computer systems - Congresses. - Verification -
電子資源:	https://doi.org/10.1007/978-3-031-45286-4
ISBN:	9783031452864

Reachability problems = 17th International Conference, RP 2023, Nice, France, October 11-13, 2023 : proceedings /
Reachability problems17th International Conference, RP 2023, Nice, France, October 11-13, 2023 : proceedings /[electronic resource] :RP 2023edited by Olivier Bournez, Enrico Formenti, Igor Potapov. - Cham :Springer Nature Switzerland :2023. - xlviii, 199 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,142350302-9743 ;. - Lecture notes in computer science ;14235..

Invited Papers -- Randomness quality and trade-offs for CA random string generators -- Regular Papers -- Complexity of Reachability Problems in Neural Networks -- Weakly synchronous systems with three machines are Turing powerful -- On the Identity and Group Problems for Complex Heisenberg Matrices -- Reachability analysis of a class of hybrid gene regulatory networks -- Quantitative Reachability Stackelberg-Pareto Synthesis -- Multi-Weighted Reachability Games -- On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions -- Adaptive Directions for Bernstein-based Polynomial Set Evolution -- Introducing Divergence for Infinite Probabilistic Models -- A Framework for the Competitive Analysis of Model Predictive Controllers -- Matching Patterns with Variables Under Simon's Congruence -- HyperMonitor: A Python Prototype for Hyper Predictive Runtime Verification -- Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs.

This book constitutes the refereed proceedings of the 17th International Conference on Reachability Problems, RP 2023, held in Nice, France, during October 11-13, 2023. The 13 full papers included in this book were carefully reviewed and selected from 19 submissions. They present recent research on reachability problems to promote the exploration of new approaches for the modeling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.

ISBN: 9783031452864

Standard No.: 10.1007/978-3-031-45286-4doiSubjects--Topical Terms:

1002491
Computer systems
--Verification--Congresses.

LC Class. No.: QA76.76.V47 / I58 2023

Dewey Class. No.: 005.14

Reachability problems = 17th International Conference, RP 2023, Nice, France, October 11-13, 2023 : proceedings /
LDR:02636nmm a2200349 a 4500 001 2335243
003 DE-He213
005 20231004102043.0
006 m d
007 cr nn 008maaau
008 240402s2023 sz s 0 eng d
020 $a 9783031452864 $q (electronic bk.)
020 $a 9783031452857 $q (paper)
024 7 $a 10.1007/978-3-031-45286-4 $2 doi
035 $a 978-3-031-45286-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.76.V47 $b I58 2023
072 7 $a UYA $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.14 $2 23
090 $a QA76.76.V47 $b I61 2023
111 2 $a International Conference on Reachability Problems $n (17th : $d 2023 : $c Nice, France) $3 3667463
245 1 0 $a Reachability problems $h [electronic resource] : $b 17th International Conference, RP 2023, Nice, France, October 11-13, 2023 : proceedings / $c edited by Olivier Bournez, Enrico Formenti, Igor Potapov.
246 3 $a RP 2023
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2023.
300 $a xlviii, 199 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 14235
505 0 $a Invited Papers -- Randomness quality and trade-offs for CA random string generators -- Regular Papers -- Complexity of Reachability Problems in Neural Networks -- Weakly synchronous systems with three machines are Turing powerful -- On the Identity and Group Problems for Complex Heisenberg Matrices -- Reachability analysis of a class of hybrid gene regulatory networks -- Quantitative Reachability Stackelberg-Pareto Synthesis -- Multi-Weighted Reachability Games -- On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions -- Adaptive Directions for Bernstein-based Polynomial Set Evolution -- Introducing Divergence for Infinite Probabilistic Models -- A Framework for the Competitive Analysis of Model Predictive Controllers -- Matching Patterns with Variables Under Simon's Congruence -- HyperMonitor: A Python Prototype for Hyper Predictive Runtime Verification -- Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs.
520 $a This book constitutes the refereed proceedings of the 17th International Conference on Reachability Problems, RP 2023, held in Nice, France, during October 11-13, 2023. The 13 full papers included in this book were carefully reviewed and selected from 19 submissions. They present recent research on reachability problems to promote the exploration of new approaches for the modeling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.
650 0 $a Computer systems $x Verification $v Congresses. $3 1002491
650 0 $a Decidability (Mathematical logic) $v Congresses. $3 3135781
650 0 $a Computer science $x Mathematics $x Congresses. $3 678603
650 1 4 $a Formal Languages and Automata Theory. $3 3592087
650 2 4 $a Computer Science Logic and Foundations of Programming. $3 3538531
650 2 4 $a Software Engineering. $3 890874
650 2 4 $a Logic in AI. $3 3386372
650 2 4 $a Design and Analysis of Algorithms. $3 3538532
650 2 4 $a Mathematics of Computing. $3 891213
700 1 $a Bournez, Olivier. $3 3667464
700 1 $a Formenti, Enrico. $3 2072424
700 1 $a Potapov, Igor. $3 1244938
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 14235. $3 3667465
856 4 0 $u https://doi.org/10.1007/978-3-031-45286-4
950 $a Computer Science (SpringerNature-11645)