|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-642-24288-5 |
003 |
DE-He213 |
005 |
20230406024232.0 |
007 |
cr nn 008mamaa |
008 |
110924s2011 gw | s |||| 0|eng d |
020 |
|
|
|a 9783642242885
|9 978-3-642-24288-5
|
024 |
7 |
|
|a 10.1007/978-3-642-24288-5
|2 doi
|
050 |
|
4 |
|a QA75.5-76.95
|
072 |
|
7 |
|a UYA
|2 bicssc
|
072 |
|
7 |
|a COM051000
|2 bisacsh
|
072 |
|
7 |
|a UYA
|2 thema
|
082 |
0 |
4 |
|a 004.0151
|2 23
|
245 |
1 |
0 |
|a Reachability Problems
|h [electronic resource] :
|b 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011, Proceedings /
|c edited by Giorgio Delzanno, Igor Potapov.
|
250 |
|
|
|a 1st ed. 2011.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2011.
|
300 |
|
|
|a XII, 245 p.
|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,
|x 2512-2029 ;
|v 6945
|
520 |
|
|
|a This book constitutes the refereed proceedings of the 5th International Workshop on Reachability Problems, RP 2011, held in Genoa, Italy, in September 2011. The 16 papers presented together with 4 invited talks were carefully reviewed and selected from 24 submissions. The workshop deals with reachability problems that appear in algebraic structures, computational models, hybrid systems, logic, and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modelled as games.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Machine theory.
|
650 |
|
0 |
|a Compilers (Computer programs).
|
650 |
|
0 |
|a Algorithms.
|
650 |
1 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
650 |
2 |
4 |
|a Software Engineering.
|
650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
650 |
2 |
4 |
|a Compilers and Interpreters.
|
650 |
2 |
4 |
|a Algorithms.
|
650 |
2 |
4 |
|a Theory of Computation.
|
700 |
1 |
|
|a Delzanno, Giorgio.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Potapov, Igor.
|e editor.
|0 (orcid)0000-0002-7192-7853
|1 https://orcid.org/0000-0002-7192-7853
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642242878
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642242892
|
830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6945
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-24288-5
|z Texto Completo
|
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)
|