東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Reachability problems = 18th Interna...

International Conference on Reachability Problems (2024 :)

FindBook

Google Book

Amazon

博客來

Reachability problems = 18th International Conference, RP 2024, Vienna, Austria, September 25-27, 2024 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Reachability problems/ edited by Laura Kovács, Ana Sokolova.
其他題名:	18th International Conference, RP 2024, Vienna, Austria, September 25-27, 2024 : proceedings /
其他題名:	RP 2024
其他作者:	Kovács, Laura.
團體作者:	International Conference on Reachability Problems
出版者:	Cham :Springer Nature Switzerland : : 2024.,
面頁冊數:	xxvi, 239 p. :ill. (some col.), digital ;24 cm.
內容註:	Invited Papers -- Quantifying Uncertainty in Probabilistic Loops without Sampling: a Fully Automated Approach -- The Satis ability and Validity Problems for Probabilistic CTL -- Computability and Reachability -- Computing Reachable Simulations on Transition Systems -- Computing All Minimal Ways to Reach a Context-Free Language -- On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems under Process Fairness -- Automata and Complexity -- Rollercoasters with Plateaus -- Quantum Automata and Languages of Finite Index -- On Shortest Products for Nonnegative Matrix Mortality -- Hardness of Busy Beaver Value BB(15) -- Linear Systems and Recurrences -- On the Complexity of Reachability and Mortality for Bounded Piecewise Affine Maps -- Semi-Linear VASR for Over-Approximate Semi-Linear System Reachability -- Reachability in Linear Recurrence Automata -- Games and Abstractions -- Robust Deterministic Abstractions for Supervising Discrete-time Continuous Systems -- Markov Decision Processes with Sure Parity and Multiple Reachability Objectives -- Modelling Dynamical Systems: Learning ODEs with No Internal ODE Resolution.
Contained By:	Springer Nature eBook
標題:	Computer systems - Congresses. - Verification -
電子資源:	https://doi.org/10.1007/978-3-031-72621-7
ISBN:	9783031726217

Reachability problems = 18th International Conference, RP 2024, Vienna, Austria, September 25-27, 2024 : proceedings /
Reachability problems18th International Conference, RP 2024, Vienna, Austria, September 25-27, 2024 : proceedings /[electronic resource] :RP 2024edited by Laura Kovács, Ana Sokolova. - Cham :Springer Nature Switzerland :2024. - xxvi, 239 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,150500302-9743 ;. - Lecture notes in computer science,15050..

Invited Papers -- Quantifying Uncertainty in Probabilistic Loops without Sampling: a Fully Automated Approach -- The Satis ability and Validity Problems for Probabilistic CTL -- Computability and Reachability -- Computing Reachable Simulations on Transition Systems -- Computing All Minimal Ways to Reach a Context-Free Language -- On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems under Process Fairness -- Automata and Complexity -- Rollercoasters with Plateaus -- Quantum Automata and Languages of Finite Index -- On Shortest Products for Nonnegative Matrix Mortality -- Hardness of Busy Beaver Value BB(15) -- Linear Systems and Recurrences -- On the Complexity of Reachability and Mortality for Bounded Piecewise Affine Maps -- Semi-Linear VASR for Over-Approximate Semi-Linear System Reachability -- Reachability in Linear Recurrence Automata -- Games and Abstractions -- Robust Deterministic Abstractions for Supervising Discrete-time Continuous Systems -- Markov Decision Processes with Sure Parity and Multiple Reachability Objectives -- Modelling Dynamical Systems: Learning ODEs with No Internal ODE Resolution.

This book constitutes the proceedings of the 18th International Conference on Reachability Problems, RP 2024, which took place in Vienna, Austria, during September 25-27, 2024. The 13 full papers included in these proceedings were carefully reviewed and selected from 37 submissions. The book also contains two invited talks in full paper length. The contributions in these proceedings cover topics from computability and reachability; automata and complexity; linear systems and recurrences; and games and abstractions.

ISBN: 9783031726217

Standard No.: 10.1007/978-3-031-72621-7doiSubjects--Topical Terms:

1002491
Computer systems
--Verification--Congresses.

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

Dewey Class. No.: 005.14

Reachability problems = 18th International Conference, RP 2024, Vienna, Austria, September 25-27, 2024 : proceedings /
LDR:02857nmm a2200349 a 4500 001 2374925
003 DE-He213
005 20240919125442.0
006 m d
007 cr nn 008maaau
008 241231s2024 sz s 0 eng d
020 $a 9783031726217 $q (electronic bk.)
020 $a 9783031726200 $q (paper)
024 7 $a 10.1007/978-3-031-72621-7 $2 doi
035 $a 978-3-031-72621-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.76.V47 $b I58 2024
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.14 $2 23
090 $a QA76.76.V47 $b I61 2024
111 2 $a International Conference on Reachability Problems $n (18th : $d 2024 : $c Vienna, Austria) $3 3724058
245 1 0 $a Reachability problems $h [electronic resource] : $b 18th International Conference, RP 2024, Vienna, Austria, September 25-27, 2024 : proceedings / $c edited by Laura Kovács, Ana Sokolova.
246 3 $a RP 2024
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2024.
300 $a xxvi, 239 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 15050
505 0 $a Invited Papers -- Quantifying Uncertainty in Probabilistic Loops without Sampling: a Fully Automated Approach -- The Satis ability and Validity Problems for Probabilistic CTL -- Computability and Reachability -- Computing Reachable Simulations on Transition Systems -- Computing All Minimal Ways to Reach a Context-Free Language -- On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems under Process Fairness -- Automata and Complexity -- Rollercoasters with Plateaus -- Quantum Automata and Languages of Finite Index -- On Shortest Products for Nonnegative Matrix Mortality -- Hardness of Busy Beaver Value BB(15) -- Linear Systems and Recurrences -- On the Complexity of Reachability and Mortality for Bounded Piecewise Affine Maps -- Semi-Linear VASR for Over-Approximate Semi-Linear System Reachability -- Reachability in Linear Recurrence Automata -- Games and Abstractions -- Robust Deterministic Abstractions for Supervising Discrete-time Continuous Systems -- Markov Decision Processes with Sure Parity and Multiple Reachability Objectives -- Modelling Dynamical Systems: Learning ODEs with No Internal ODE Resolution.
520 $a This book constitutes the proceedings of the 18th International Conference on Reachability Problems, RP 2024, which took place in Vienna, Austria, during September 25-27, 2024. The 13 full papers included in these proceedings were carefully reviewed and selected from 37 submissions. The book also contains two invited talks in full paper length. The contributions in these proceedings cover topics from computability and reachability; automata and complexity; linear systems and recurrences; and games and abstractions.
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 Kovács, Laura. $3 3714776
700 1 $a Sokolova, Ana. $3 3459063
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science, $x 0302-9743 ; $v 15050. $3 3724059
856 4 0 $u https://doi.org/10.1007/978-3-031-72621-7
950 $a Computer Science (SpringerNature-11645)