東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Reachability problems = 11th Interna...

RP (Workshop) (2017 :)

Linked to FindBook

Google Book

Amazon

博客來

Reachability problems = 11th International Workshop, RP 2017, London, UK, September 7-9, 2017 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Reachability problems/ edited 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:	RP (Workshop)
Published:	Cham :Springer International Publishing : : 2017.,
Description:	xv, 193 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Computer systems - Congresses. - Verification -
Online resource:	http://dx.doi.org/10.1007/978-3-319-67089-8
ISBN:	9783319670898

Reachability problems = 11th 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 ;10506..

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

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

1002491
Computer systems
--Verification--Congresses.

LC Class. No.: QA76.76.V47

Dewey Class. No.: 004

Reachability problems = 11th International Workshop, RP 2017, London, UK, September 7-9, 2017 : proceedings /
LDR:02123nmm a2200325 a 4500 001 2106177
003 DE-He213
005 20170824165433.0
006 m d
007 cr nn 008maaau
008 180417s2017 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 $a RP (Workshop) $n (11th : $d 2017 : $c London, England) $3 3251814
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 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
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 891214
650 2 4 $a Computing Methodologies. $3 830243
700 1 $a Hague, Matthew. $3 3251815
700 1 $a Potapov, Igor. $3 1244938
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 10506. $3 3251816
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-67089-8
950 $a Computer Science (Springer-11645)