LEADER 04563nam 22007455 450 001 9910483366203321 005 20230406020455.0 010 $a3-540-74407-X 024 7 $a10.1007/978-3-540-74407-8 035 $a(CKB)1000000000490458 035 $a(SSID)ssj0000316970 035 $a(PQKBManifestationID)11240520 035 $a(PQKBTitleCode)TC0000316970 035 $a(PQKBWorkID)10276729 035 $a(PQKB)10652467 035 $a(DE-He213)978-3-540-74407-8 035 $a(MiAaPQ)EBC3063437 035 $a(MiAaPQ)EBC6709570 035 $a(Au-PeEL)EBL6709570 035 $a(PPN)123164427 035 $a(EXLCZ)991000000000490458 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCONCUR 2007 - Concurrency Theory $e18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings /$fedited by Luís Caires, Vasco T. Vasconcelos 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XIII, 510 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4703 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-74406-1 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- Mapping the Security Landscape: A Role for Language Techniques -- The Saga of the Axiomatization of Parallel Composition -- Rule-Based Modelling of Cellular Signalling -- Contributed Papers -- Making Random Choices Invisible to the Scheduler -- Strategy Logic -- Solving Games Via Three-Valued Abstraction Refinement -- Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness -- On Modal Refinement and Consistency -- Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems -- Decidability Results for Well-Structured Transition Systems with Auxiliary Storage -- A Nice Labelling for Tree-Like Event Structures of Degree 3 -- Causal Message Sequence Charts -- Checking Coverage for Infinite Collections of Timed Scenarios -- Is Observational Congruence Axiomatisable in Equational Horn Logic? -- The Must Preorder Revisited -- Topology-Dependent Abstractions of Broadcast Networks -- On the Expressive Power of Global and Local Priority in Process Calculi -- A Marriage of Rely/Guarantee and Separation Logic -- Fair Cooperative Multithreading -- Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures -- Automatic Derivation of Compositional Rules in Automated Compositional Reasoning -- Compositional Event Structure Semantics for the Internal ?-Calculus -- Interpreting a Finitary Pi-calculus in Differential Interaction Nets -- Mobility Control Via Passports -- Coalgebraic Models for Reactive Systems -- Reactive Systems over Directed Bigraphs -- Asynchronous Games: Innocence Without Alternation -- Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes -- Strategy Synthesis for Markov Decision Processes and Branching-Time Logics -- Timed Concurrent Game Structures -- Pushdown Module Checking with Imperfect Information -- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages -- Temporal Antecedent Failure: Refining Vacuity. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4703 606 $aComputer science 606 $aComputer systems 606 $aCompilers (Computer programs) 606 $aComputer programming 606 $aTheory of Computation 606 $aComputer System Implementation 606 $aComputer Science Logic and Foundations of Programming 606 $aCompilers and Interpreters 606 $aProgramming Techniques 615 0$aComputer science. 615 0$aComputer systems. 615 0$aCompilers (Computer programs). 615 0$aComputer programming. 615 14$aTheory of Computation. 615 24$aComputer System Implementation. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aCompilers and Interpreters. 615 24$aProgramming Techniques. 676 $a004.35 702 $aCaires$b Lui?s 702 $aVasconcelos$b Vasco T. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483366203321 996 $aCONCUR 2007 – Concurrency Theory$9772427 997 $aUNINA