LEADER 00945nam0-22003251i-450- 001 990008031830403321 005 20100713121427.0 010 $a0406561524 035 $a000803183 035 $aFED01000803183 035 $a(Aleph)000803183FED01 035 $a000803183 100 $a20050329d1983----km-y0itay50------ba 101 0 $aeng 102 $aGB 105 $ay---n---001yy 200 1 $aFrench administrative law$fNeville Brown L. and J. F. Garner$gwith the assistance of Jean-Michel Galabert 205 $a3rd ed. 210 $aLondon$cButterworths$d1983 215 $aXVII, 218 p.$d22 cm 676 $a342$v11 rid.$zita 700 1$aBrown,$bNeville L.$0183367 701 1$aGarner,$bJ. F.$g$029494 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990008031830403321 952 $aVI A 258$b5229$fDDA 959 $aDDA 996 $aFrench administrative law$9755224 997 $aUNINA LEADER 00861nam--2200337---450- 001 990003177880203316 005 20081125094452.0 035 $a000317788 035 $aUSA01000317788 035 $a(ALEPH)000317788USA01 035 $a000317788 100 $a20081125d1910----km-y0itay50------ba 101 $afre 102 $aFR 105 $a||||||||001yy 200 1 $a<>'ange gardien$ecomédie en trois actes$fpar André Picard 210 $d1910 215 $cill.$d29 cm 410 0$12001 454 1$12001 461 1$1001-------$12001 606 0 $aTeatro$yFrancia$z1910 700 1$aPICARD,$bAndré$0602810 801 0$aIT$bsalbc$gISBD 912 $a990003177880203316 951 $aII.4.D.2$b2998 DSLL 959 $aBK 969 $aDSLL 979 $aDSLL$b90$c20081125$lUSA01$h0944 996 $aAnge gardien$91013785 997 $aUNISA LEADER 05386nam 22007455 450 001 9910768459103321 005 20250724093359.0 010 $a3-540-44685-0 024 7 $a10.1007/3-540-44685-0 035 $a(CKB)1000000000211633 035 $a(SSID)ssj0000322216 035 $a(PQKBManifestationID)11247764 035 $a(PQKBTitleCode)TC0000322216 035 $a(PQKBWorkID)10282830 035 $a(PQKB)11221276 035 $a(DE-He213)978-3-540-44685-9 035 $a(MiAaPQ)EBC3073348 035 $a(PPN)15516967X 035 $a(EXLCZ)991000000000211633 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCONCUR 2001 - Concurrency Theory $e12th International Conference, Aalborg, Denmark, August 20-25, 2001 Proceedings /$fedited by Kim G. Larsen, Mogens Nielsen 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (XI, 589 p.) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v2154 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-42497-0 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talks -- Channel Representations in Protocol Verification -- Bigraphical Reactive Systems -- Control of Networks of Unmanned Vehicles -- Process Algebra and Security (Abstract) -- Invited Tutorials -- Using the Bandera Tool Set to Model-Check Properties of Concurrent Java Software -- Performance Evaluation:= (Process Algebra + Model Checking) X Markov Chains -- Mobility -- Typing Mobility in the Seal Calculus -- Reasoning about Security in Mobile Ambients -- Synchronized Hyperedge Replacement with Name Mobility -- Dynamic Input/Output Automata: A Formal Model for Dynamic Systems -- Probabilistic Systems -- Probabilistic Information Flow in a Process Algebra -- Symbolic Computation of Maximal Probabilisti Reachability -- Randomized Non-sequential Processes -- Model Checking -- Liveness and Fairness in Process-Algebraic Verification -- Bounded Reachability Checking with Process Semantics -- Techniques for Smaller Intermediary BDDs -- An Algebraic Characterization of Data and Timed Languages -- Process Algebra -- A Faster-than Relation for Asynchronous Processes -- On the Power of Labels in Transition Systems -- On Barbed Equivalences in ?-Calculus -- CCS with Priority Guards -- Probabilistic Systems -- A Testing Theory for Generally Distributed Stochastic Processes -- An Algorithm for Quantitative Verification of Probabilistic Transition Systems -- Compositional Methods for Probabilistic Systems -- Unfoldings and Prefixes -- Towards an Efficient Algorithm for Unfolding Petri Nets -- A Static Analysis Technique for Graph Transformation Systems -- Local First Search ? A New Paradigm for Partial Order Reductions -- Extending Memory Consistency of Finite Prefixes to Infinite Computations -- Model Checking -- Abstraction-Based Model Checking Using Modal Transition Systems -- Efficient Multiple-ValuedModel-Checking Using Lattice Representations -- Divide and Compose: SCC Refinement for Language Emptiness -- Unavoidable Configurations of Parameterized Rings of Processes -- Logic and Compositionality -- Logic of Global Synchrony -- Compositional Modeling of Reactive Systems Using Open Nets -- Extended Temporal Logic Revisited -- Games -- Symbolic Algorithms for Infinite-State Games -- A Game-Based Verification of Non-repudiation and Fair Exchange Protocols -- The Control of Synchronous Systems, Part II. 330 $aThis book constitutes the refereed proceedings of the 12th International Conference on Concurrency Theory, CONCUR 2001, held in Aalborg, Denmark in August 2001. The 32 revised full papers presented together with six invited contributions were carefully reviewed and selected from 78 submissions. The papers are organized in topical sections on mobility, probabilistic systems, model checking, process algebra, unfoldings and prefixes, logic and compositionality, and games. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v2154 606 $aComputer science 606 $aComputer systems 606 $aAlgebra 606 $aCompilers (Computer programs) 606 $aTheory of Computation 606 $aComputer System Implementation 606 $aAlgebra 606 $aComputer Science Logic and Foundations of Programming 606 $aCompilers and Interpreters 615 0$aComputer science. 615 0$aComputer systems. 615 0$aAlgebra. 615 0$aCompilers (Computer programs) 615 14$aTheory of Computation. 615 24$aComputer System Implementation. 615 24$aAlgebra. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aCompilers and Interpreters. 676 $a004.35 702 $aLarsen$b Kim G$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aNielsen$b Mogens$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Concurrency Theory. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910768459103321 996 $aCONCUR 2001 - concurrency theory$9970255 997 $aUNINA