國立高雄大學圖資館 |

Language: English

Back

Reachability problems11th Internatio...

(1998 :)

Reachability problems11th International Workshop, RP 2017, London, UK, September 7-9, 2017 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Reachability problemsedited by Matthew Hague, Igor Potapov.
Reminder of title:	11th International Workshop, RP 2017, London, UK, September 7-9, 2017 : proceedings /
remainder title:	RP 2017
other author:	Hague, Matthew.
corporate name:
Published:	Cham :Springer International Publishing :2017.
Description:	xv, 193 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Computer systemsCongresses.Verification
Online resource:	http://dx.doi.org/10.1007/978-3-319-67089-8
ISBN:	9783319670898$q(electronic bk.)

Reachability problems11th International Workshop, RP 2017, London, UK, September 7-9, 2017 : proceedings /
Reachability problems11th International Workshop, RP 2017, London, UK, September 7-9, 2017 : proceedings /[electronic resource] :RP 2017edited by Matthew Hague, Igor Potapov. - Cham :Springer International Publishing :2017. - xv, 193 p. :ill., digital ;24 cm. - Lecture notes in computer science,105060302-9743 ;. - Lecture notes in computer science ;4891..

This book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017. The 12 full papers presented together with 1 invited paper were carefully reviewed and selected from 17 submissions. The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite 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: 9783319670898$q(electronic bk.)

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

445015
Computer systems
--Verification--Congresses.

LC Class. No.: QA76.76.V47

Dewey Class. No.: 004

Reachability problems11th International Workshop, RP 2017, London, UK, September 7-9, 2017 : proceedings /
LDR:02132nmm a2200325 a 4500 001 521134
003 DE-He213
005 20170824165433.0
006 m d
007 cr nn 008maaau
008 180504s2017 gw s 0 eng d
020 $a 9783319670898$q(electronic bk.)
020 $a 9783319670881$q(paper)
024 7 $a 10.1007/978-3-319-67089-8 $2 doi
035 $a 978-3-319-67089-8
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 2017
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Reachability problems $h [electronic resource] : $b 11th International Workshop, RP 2017, London, UK, September 7-9, 2017 : proceedings / $c edited by Matthew Hague, Igor Potapov.
246 3 $a RP 2017
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a xv, 193 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10506
520 $a This book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017. The 12 full papers presented together with 1 invited paper were carefully reviewed and selected from 17 submissions. The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite 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 445015
650 0 $a Decidability (Mathematical logic) $v Congresses. $3 453059
650 0 $a Computer science $x Mathematics $3 253427
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Computation by Abstract Devices. $3 273703
650 2 4 $a Logics and Meanings of Programs. $3 275357
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 273711
650 2 4 $a Computing Methodologies. $3 274528
700 1 $a Hague, Matthew. $3 790944
700 1 $a Potapov, Igor. $3 376700
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-67089-8
950 $a Computer Science (Springer-11645)