國立虎尾科技大學 |

Reachability Problems = 13th International Conference, RP 2019, Brussels, Belgium, September 11–13, 2019, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Reachability Problems/ edited by Emmanuel Filiot, Raphaël Jungers, Igor Potapov.
其他題名:	13th International Conference, RP 2019, Brussels, Belgium, September 11–13, 2019, Proceedings /
其他作者:	Filiot, Emmanuel.
面頁冊數:	XX, 233 p. 275 illus., 14 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer logic. -
電子資源:	https://doi.org/10.1007/978-3-030-30806-3
ISBN:	9783030308063

Reachability Problems = 13th International Conference, RP 2019, Brussels, Belgium, September 11–13, 2019, Proceedings /
Reachability Problems13th International Conference, RP 2019, Brussels, Belgium, September 11–13, 2019, Proceedings /[electronic resource] :edited by Emmanuel Filiot, Raphaël Jungers, Igor Potapov. - 1st ed. 2019. - XX, 233 p. 275 illus., 14 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11674. - Theoretical Computer Science and General Issues ;9163.

Bidding Games on Markov Decision Processes -- Primitivity and synchronizing automata: a functional analytic approach -- Reaching Out Towards Fully Veriﬁed Autonomous Systems -- On the m-eternal Domination Number of Cactus Graphs -- On Relevant Equilibria in Reachability Games -- Partial Solvers for Generalized Parity Games -- Reachability in Augmented Interval Markov Chains -- On Solving Word Equations Using SAT -- Parameterised Veriﬁcation of Publish/Subscribe Networks with Exception Handling -- Cellular automata for the self-stabilisation of colourings and tilings -- On the termination problem for counter machines with incrementing errors -- Reachability Problems on Partially Lossy Queue Automata -- On the computation of the minimal coverability set of Petri nets -- Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds -- Coverability is undecidable in one-dimensional pushdown vector addition systems with resets -- Synthesis of structurally restricted b-bounded Petri nets: complexity results -- Reachability of Five Gossip Protocols.

This book constitutes the refereed proceedings of the 13th International Conference on Reachability Problems, RP 2019, held in Brussels, Belgium, in September 2019. The 14 full papers presented were carefully reviewed and selected from 26 submissions. The papers cover topics such as reachability for infinite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps; and new computational paradigms.

ISBN: 9783030308063

Standard No.: 10.1007/978-3-030-30806-3doiSubjects--Topical Terms:

786340
Computer logic.

LC Class. No.: QA76.9.L63

Dewey Class. No.: 005.1015113

Reachability Problems = 13th International Conference, RP 2019, Brussels, Belgium, September 11–13, 2019, Proceedings /
LDR:03345nam a22004335i 4500 001 1007455
003 DE-He213
005 20200704163920.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030308063 $9 978-3-030-30806-3
024 7 $a 10.1007/978-3-030-30806-3 $2 doi
035 $a 978-3-030-30806-3
050 4 $a QA76.9.L63
050 4 $a QA76.5913
072 7 $a UM $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UM $2 thema
072 7 $a UYF $2 thema
082 0 4 $a 005.1015113 $2 23
245 1 0 $a Reachability Problems $h [electronic resource] : $b 13th International Conference, RP 2019, Brussels, Belgium, September 11–13, 2019, Proceedings / $c edited by Emmanuel Filiot, Raphaël Jungers, Igor Potapov.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XX, 233 p. 275 illus., 14 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 11674
505 0 $a Bidding Games on Markov Decision Processes -- Primitivity and synchronizing automata: a functional analytic approach -- Reaching Out Towards Fully Veriﬁed Autonomous Systems -- On the m-eternal Domination Number of Cactus Graphs -- On Relevant Equilibria in Reachability Games -- Partial Solvers for Generalized Parity Games -- Reachability in Augmented Interval Markov Chains -- On Solving Word Equations Using SAT -- Parameterised Veriﬁcation of Publish/Subscribe Networks with Exception Handling -- Cellular automata for the self-stabilisation of colourings and tilings -- On the termination problem for counter machines with incrementing errors -- Reachability Problems on Partially Lossy Queue Automata -- On the computation of the minimal coverability set of Petri nets -- Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds -- Coverability is undecidable in one-dimensional pushdown vector addition systems with resets -- Synthesis of structurally restricted b-bounded Petri nets: complexity results -- Reachability of Five Gossip Protocols.
520 $a This book constitutes the refereed proceedings of the 13th International Conference on Reachability Problems, RP 2019, held in Brussels, Belgium, in September 2019. The 14 full papers presented were carefully reviewed and selected from 26 submissions. The papers cover topics such as reachability for infinite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps; and new computational paradigms.
650 0 $a Computer logic. $3 786340
650 0 $a Software engineering. $3 562952
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computer system failures. $3 782237
650 0 $a Computers. $3 565115
650 0 $a Computer science—Mathematics. $3 1253519
650 1 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Software Engineering. $3 669632
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a System Performance and Evaluation. $3 669346
650 2 4 $a The Computing Profession. $3 669954
650 2 4 $a Mathematics of Computing. $3 669457
700 1 $a Filiot, Emmanuel. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1301225
700 1 $a Jungers, Raphaël. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1301226
700 1 $a Potapov, Igor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 793384
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030308056
776 0 8 $i Printed edition: $z 9783030308070
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-30806-3
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)