LEADER 01907nam 22004933a 450 001 9910842025803321 005 20250204001015.0 010 $a9786613667441 010 $a9781280690501 010 $a128069050X 010 $a9780776627199 010 $a0776627198 010 $a9780776617770 010 $a077661777X 010 $a9780776606842 010 $a0776606840 024 8 $a10.26530/OAPEN_578766 035 $a(CKB)30892148200041 035 $a(VaAlCD)20.500.12592/wf0n9z 035 $a(ScCtBLL)0fa0cbec-caf1-45f7-9898-18196ce929c3 035 $a(OCoLC)1163825732 035 $a(EXLCZ)9930892148200041 100 $a20250204i20082020 uu 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aDefending a Contested Ideal$fLuc Juillet, Ken Rasmussen 210 1$a[s.l.] :$cUniversity of Ottawa Press / Les Presses de l'Université d'Ottawa,$d2008. 215 $a1 online resource (1 p.) 330 $aIn 1908, after decades of struggling with a public administration undermined by systemic patronage, the Canadian parliament decided that public servants would be selected on the basis of merit, through a system administered by an independent agency: the Public Service Commission of Canada. This history, celebrating the 100th anniversary of the Commission, recounts its unique contribution to the development of an independent public service, which has become a pillar of Canadian parliamentary democracy. 606 $aPolitical Science$2bisacsh 606 $aPolitical science 615 7$aPolitical Science 615 0$aPolitical science. 700 $aJuillet$b Luc$01717301 702 $aRasmussen$b Ken 801 0$bScCtBLL 801 1$bScCtBLL 906 $aBOOK 912 $a9910842025803321 996 $aDefending a Contested Ideal$94321279 997 $aUNINA LEADER 03895nam 22007935 450 001 9910484957303321 005 20250317142257.0 010 $a9783642410369 010 $a3642410367 024 7 $a10.1007/978-3-642-41036-9 035 $a(CKB)3710000000019177 035 $a(SSID)ssj0001010893 035 $a(PQKBManifestationID)11605880 035 $a(PQKBTitleCode)TC0001010893 035 $a(PQKBWorkID)11002776 035 $a(PQKB)11621468 035 $a(DE-He213)978-3-642-41036-9 035 $a(MiAaPQ)EBC3093145 035 $a(PPN)172430380 035 $a(EXLCZ)993710000000019177 100 $a20130903d2013 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aReachability Problems $e7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013, Proceedings /$fedited by Parosh Aziz Abdulla, Igor Potapov 205 $a1st ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (XII, 223 p. 60 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8169 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a9783642410352 311 08$a3642410359 327 $aReachability 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8169 606 $aComputer science 606 $aSoftware engineering 606 $aMachine theory 606 $aCompilers (Computer programs) 606 $aAlgorithms 606 $aComputer Science Logic and Foundations of Programming 606 $aSoftware Engineering 606 $aFormal Languages and Automata Theory 606 $aCompilers and Interpreters 606 $aAlgorithms 606 $aTheory of Computation 615 0$aComputer science. 615 0$aSoftware engineering. 615 0$aMachine theory. 615 0$aCompilers (Computer programs) 615 0$aAlgorithms. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aSoftware Engineering. 615 24$aFormal Languages and Automata Theory. 615 24$aCompilers and Interpreters. 615 24$aAlgorithms. 615 24$aTheory of Computation. 676 $a004.21 702 $aAbdulla$b Parosh Aziz$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPotapov$b Igor$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484957303321 996 $aReachability Problems$93573647 997 $aUNINA