Language:
English
繁體中文
Help
圖資館首頁
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Reachability problems15th Internatio...
~
(1998 :)
Reachability problems15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings /
Record Type:
Electronic resources : Monograph/item
Title/Author:
Reachability problemsedited by Paul C. Bell, Patrick Totzke, Igor Potapov.
Reminder of title:
15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings /
remainder title:
RP 2021
other author:
Bell, Paul C.
corporate name:
Published:
Cham :Springer International Publishing :2021.
Description:
xviii, 165 p. :ill. (some col.), digital ;24 cm.
Contained By:
Springer Nature eBook
Subject:
Computer systemsCongresses.Verification
Online resource:
https://doi.org/10.1007/978-3-030-89716-1
ISBN:
9783030897161$q(electronic bk.)
Reachability problems15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings /
Reachability problems
15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings /[electronic resource] :RP 2021edited by Paul C. Bell, Patrick Totzke, Igor Potapov. - Cham :Springer International Publishing :2021. - xviii, 165 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,130350302-9743 ;. - Lecture notes in computer science ;4891..
Invited Papers -- Quantitative vs. Weighted Automata -- Theorem Proving Using Clausal Resolution: From Past to Present -- Population Protocols: Beyond Runtime Analysis -- Recent Advances on Reachability Problems for Valence Systems (Invited Talk) -- Regular Papers -- Improvements in Unfolding of Colored Petri Nets -- Reachability of weakly nonlinear systems using Carleman linearization -- Continued Fraction approach to Gauss-Reduction theory -- Absent Subsequences in Words -- Minimal Number of Calls in Propositional Protocols -- Reachability Is NP-Complete Even for the Simplest Neural Networks.
Chapter 'Recent Advances on Reachability Problems for Valence Systems' is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
ISBN: 9783030897161$q(electronic bk.)
Standard No.: 10.1007/978-3-030-89716-1doiSubjects--Topical Terms:
445015
Computer systems
--Verification--Congresses.
LC Class. No.: QA76.76.V47 / I58 2021
Dewey Class. No.: 005.14
Reachability problems15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings /
LDR
:02052nmm a2200373 a 4500
001
610536
003
DE-He213
005
20211025132038.0
006
m d
007
cr nn 008maaau
008
220330s2021 sz s 0 eng d
020
$a
9783030897161$q(electronic bk.)
020
$a
9783030897154$q(paper)
024
7
$a
10.1007/978-3-030-89716-1
$2
doi
035
$a
978-3-030-89716-1
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA76.76.V47
$b
I58 2021
072
7
$a
UY
$2
bicssc
072
7
$a
COM014000
$2
bisacsh
072
7
$a
UY
$2
thema
072
7
$a
UYA
$2
thema
082
0 4
$a
005.14
$2
23
090
$a
QA76.76.V47
$b
I61 2021
111
2
$n
(3rd :
$d
1998 :
$c
Amsterdam, Netherlands)
$3
194767
245
1 0
$a
Reachability problems
$h
[electronic resource] :
$b
15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings /
$c
edited by Paul C. Bell, Patrick Totzke, Igor Potapov.
246
3
$a
RP 2021
260
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2021.
300
$a
xviii, 165 p. :
$b
ill. (some col.), digital ;
$c
24 cm.
490
1
$a
Lecture notes in computer science,
$x
0302-9743 ;
$v
13035
490
1
$a
Theoretical computer science and general issues
505
0
$a
Invited Papers -- Quantitative vs. Weighted Automata -- Theorem Proving Using Clausal Resolution: From Past to Present -- Population Protocols: Beyond Runtime Analysis -- Recent Advances on Reachability Problems for Valence Systems (Invited Talk) -- Regular Papers -- Improvements in Unfolding of Colored Petri Nets -- Reachability of weakly nonlinear systems using Carleman linearization -- Continued Fraction approach to Gauss-Reduction theory -- Absent Subsequences in Words -- Minimal Number of Calls in Propositional Protocols -- Reachability Is NP-Complete Even for the Simplest Neural Networks.
520
$a
Chapter 'Recent Advances on Reachability Problems for Valence Systems' is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
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
Theory of Computation.
$3
274475
650
2 4
$a
Artificial Intelligence.
$3
212515
650
2 4
$a
Software Engineering/Programming and Operating Systems.
$3
273711
650
2 4
$a
Computer Systems Organization and Communication Networks.
$3
273709
700
1
$a
Bell, Paul C.
$3
908553
700
1
$a
Totzke, Patrick.
$3
908554
700
1
$a
Potapov, Igor.
$3
376700
710
2
$a
SpringerLink (Online service)
$3
273601
773
0
$t
Springer Nature eBook
830
0
$a
Lecture notes in computer science ;
$v
4891.
$3
383229
830
0
$a
Theoretical computer science and general issues.
$3
822018
856
4 0
$u
https://doi.org/10.1007/978-3-030-89716-1
950
$a
Computer Science (SpringerNature-11645)
based on 0 review(s)
ALL
電子館藏
Items
1 records • Pages 1 •
1
Inventory Number
Location Name
Item Class
Material type
Call number
Usage Class
Loan Status
No. of reservations
Opac note
Attachments
000000206847
電子館藏
1圖書
電子書
EB QA76.76.V47 I61 2021 2021
一般使用(Normal)
On shelf
0
1 records • Pages 1 •
1
Multimedia
Multimedia file
https://doi.org/10.1007/978-3-030-89716-1
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login