東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Reachability problems = 10th Interna...

RP (Workshop) (2016 :)

Linked to FindBook

Google Book

Amazon

博客來

Reachability problems = 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Reachability problems/ edited by Kim Guldstrand Larsen, Igor Potapov, Jiri Srba.
Reminder of title:	10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016 : proceedings /
remainder title:	RP 2016
other author:	Larsen, Kim Guldstrand.
corporate name:	RP (Workshop)
Published:	Cham :Springer International Publishing : : 2016.,
Description:	xiv, 193 p. :ill., digital ;24 cm.
[NT 15003449]:	The Ideal Theory for WSTS -- Rare events for Statistical Model Checking -- On the Complexity of Resource-Bounded Logics -- Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets have Marked Graph Reachability Graphs -- Reachability Predicates for Graph Assertions -- Occam's Razor Applied to the Petri Net Coverability Problem -- Safety Property-driven Stubborn Sets -- Characterizing Word Problems of Groups -- Distributed Synthesis of State-Dependent Switching Control -- Compositional Analysis of Boolean Networks Using Local Fixed-point Iterations -- Decidable Models of Integer-manipulating Programs with Recursive Parallelism -- Robot Games with States in Dimension One -- Insertion-deletion Systems over Relational Words.
Contained By:	Springer eBooks
Subject:	Computer systems - Congresses. - Verification -
Online resource:	http://dx.doi.org/10.1007/978-3-319-45994-3
ISBN:	9783319459943$q(electronic bk.)

Reachability problems = 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016 : proceedings /
Reachability problems10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016 : proceedings /[electronic resource] :RP 2016edited by Kim Guldstrand Larsen, Igor Potapov, Jiri Srba. - Cham :Springer International Publishing :2016. - xiv, 193 p. :ill., digital ;24 cm. - Lecture notes in computer science,98990302-9743 ;. - Lecture notes in computer science ;9899..

The Ideal Theory for WSTS -- Rare events for Statistical Model Checking -- On the Complexity of Resource-Bounded Logics -- Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets have Marked Graph Reachability Graphs -- Reachability Predicates for Graph Assertions -- Occam's Razor Applied to the Petri Net Coverability Problem -- Safety Property-driven Stubborn Sets -- Characterizing Word Problems of Groups -- Distributed Synthesis of State-Dependent Switching Control -- Compositional Analysis of Boolean Networks Using Local Fixed-point Iterations -- Decidable Models of Integer-manipulating Programs with Recursive Parallelism -- Robot Games with States in Dimension One -- Insertion-deletion Systems over Relational Words.

This book constitutes the refereed proceedings of the 10th International Workshop on Reachability Problems, RP 2016, held in Aalborg, Denmark, in September 2016. The 11 full papers presented together with2 invited papers and 3 abstracts of invited talks were carefully reviewed and selected from 18 submissions. The papers cover a range of topics in the field of 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: 9783319459943$q(electronic bk.)

Standard No.: 10.1007/978-3-319-45994-3doiSubjects--Topical Terms:

1002491
Computer systems
--Verification--Congresses.

LC Class. No.: QA76.76.V47

Dewey Class. No.: 004

Reachability problems = 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016 : proceedings /
LDR:02640nmm a2200337 a 4500 001 2052436
003 DE-He213
005 20160912122516.0
006 m d
007 cr nn 008maaau
008 170421s2016 gw s 0 eng d
020 $a 9783319459943$q(electronic bk.)
020 $a 9783319459936$q(paper)
024 7 $a 10.1007/978-3-319-45994-3 $2 doi
035 $a 978-3-319-45994-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.76.V47
072 7 $a UYZG $2 bicssc
072 7 $a COM037000 $2 bisacsh
082 0 4 $a 004 $2 23
090 $a QA76.76.V47 $b R893 2016
111 2 $a RP (Workshop) $n (10th : $d 2016 : $c Alborg, Denmark) $3 3135778
245 1 0 $a Reachability problems $h [electronic resource] : $b 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016 : proceedings / $c edited by Kim Guldstrand Larsen, Igor Potapov, Jiri Srba.
246 3 $a RP 2016
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xiv, 193 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9899
505 0 $a The Ideal Theory for WSTS -- Rare events for Statistical Model Checking -- On the Complexity of Resource-Bounded Logics -- Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets have Marked Graph Reachability Graphs -- Reachability Predicates for Graph Assertions -- Occam's Razor Applied to the Petri Net Coverability Problem -- Safety Property-driven Stubborn Sets -- Characterizing Word Problems of Groups -- Distributed Synthesis of State-Dependent Switching Control -- Compositional Analysis of Boolean Networks Using Local Fixed-point Iterations -- Decidable Models of Integer-manipulating Programs with Recursive Parallelism -- Robot Games with States in Dimension One -- Insertion-deletion Systems over Relational Words.
520 $a This book constitutes the refereed proceedings of the 10th International Workshop on Reachability Problems, RP 2016, held in Aalborg, Denmark, in September 2016. The 11 full papers presented together with2 invited papers and 3 abstracts of invited talks were carefully reviewed and selected from 18 submissions. The papers cover a range of topics in the field of 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 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 Computer Science. $3 626642
650 2 4 $a Computation by Abstract Devices. $3 891207
650 2 4 $a Logics and Meanings of Programs. $3 892495
650 2 4 $a Mathematical Logic and Formal Languages. $3 892517
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
700 1 $a Larsen, Kim Guldstrand. $3 1072780
700 1 $a Potapov, Igor. $3 1244938
700 1 $a Srba, Jiri. $3 3135779
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 9899. $3 3135780
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-45994-3
950 $a Computer Science (Springer-11645)