|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-642-41036-9 |
003 |
DE-He213 |
005 |
20230221144213.0 |
007 |
cr nn 008mamaa |
008 |
130903s2013 gw | s |||| 0|eng d |
020 |
|
|
|a 9783642410369
|9 978-3-642-41036-9
|
024 |
7 |
|
|a 10.1007/978-3-642-41036-9
|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 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013, Proceedings /
|c edited by Parosh Aziz Abdulla, Igor Potapov.
|
250 |
|
|
|a 1st ed. 2013.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2013.
|
300 |
|
|
|a XII, 223 p. 60 illus.
|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 8169
|
505 |
0 |
|
|a Reachability for finite 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.
|
520 |
|
|
|a This book constitutes the refereed proceedings of the 7th International Workshop on Reachability Problems, RP 2013, held in Uppsala, Sweden, in September 2013. The 19 revised papers (The 14 revised papers were carefully reviewed and selected from 24 submissions in addition to 5 invited talks) were carefully reviewed and selected from 24 submissions. Topics of interest include reachability for finite 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 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 Abdulla, Parosh Aziz.
|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 9783642410376
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642410352
|
830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 8169
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-41036-9
|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)
|