000 04295nam a22003855i 4500
001 296463
003 MX-SnUAN
005 20170705134236.0
007 cr nn 008mamaa
008 150903s2006 gw | o |||| 0|eng d
020 _a9783540373773
_99783540373773
024 7 _a10.1007/11817949
_2doi
035 _avtls000349308
039 9 _a201509030737
_bVLOAD
_c201404121214
_dVLOAD
_c201404090951
_dVLOAD
_y201402071159
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.L63
100 1 _aBaier, Christel.
_eeditor.
_9331551
245 1 0 _aCONCUR 2006 – Concurrency Theory :
_b17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006. Proceedings /
_cedited by Christel Baier, Holger Hermanns.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2006.
300 _axiii, 525 páginas Also available online.
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4137
500 _aSpringer eBooks
505 0 _aInvited Contributions -- Modeling Timed Concurrent Systems -- Some Remarks on Definability of Process Graphs -- Sanity Checks in Formal Verification -- Invited Tutorials -- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi -- Probability and Nondeterminism in Operational Models of Concurrency -- Model Checking -- A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems -- Proving Liveness by Backwards Reachability -- Model Checking Quantified Computation Tree Logic -- Process Calculi -- Liveness, Fairness and Impossible Futures -- Checking a Mutex Algorithm in a Process Algebra with Fairness -- A Complete Axiomatic Semantics for the CSP Stable-Failures Model -- Transition Systems of Elementary Net Systems with Localities -- Minimization and Equivalence Checking -- Operational Determinism and Fast Algorithms -- Minimization, Learning, and Conformance Testing of Boolean Programs -- A Capability Calculus for Concurrency and Determinism -- Types -- A New Type System for Deadlock-Free Processes -- Sortings for Reactive Systems -- Dynamic Access Control in a Concurrent Object Calculus -- Semantics -- Concurrent Rewriting for Graphs with Equivalences -- Event Structure Semantics for Nominal Calculi -- Encoding ?Duce in the ??-Calculus -- Probability -- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification -- Probabilistic I/O Automata: Theories of Two Equivalences -- Reachability in Recursive Markov Decision Processes -- Strategy Improvement for Stochastic Rabin and Streett Games -- Bisimulation and Simulation -- Weak Bisimulation Up to Elaboration -- Generic Forward and Backward Simulations -- On Finite Alphabets and Infinite Bases III: Simulation -- Real Time -- Inference of Event-Recording Automata Using Timed Decision Trees -- Controller Synthesis for MTL Specifications -- On Interleaving in Timed Automata -- Formal Languages -- A Language for Task Orchestration and Its Semantic Properties -- Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words -- Second-Order Simple Grammars.
520 _aThis book constitutes the refereed proceedings of the 17th International Conference on Concurrency Theory, CONCUR 2006, held in Bonn, Germany in August 2006. The 29 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 101 submissions. The papers are organized in topical sections on model checking, process calculi, minimization and equivalence checking, types, semantics, probability, bisimulation and simulation, real time, and formal languages.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aHermanns, Holger.
_eeditor.
_9331104
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783540373766
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/11817949
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c296463
_d296463