000 05397nam a22003975i 4500
001 306418
003 MX-SnUAN
005 20160429160035.0
007 cr nn 008mamaa
008 150903s2012 gw | o |||| 0|eng d
020 _a9783642334757
_99783642334757
024 7 _a10.1007/9783642334757
_2doi
035 _avtls000360242
039 9 _a201509030602
_bVLOAD
_c201405070256
_dVLOAD
_y201402201428
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA75.5-76.95
100 1 _aBaeten, Jos C. M.
_eeditor.
_9345691
245 1 0 _aTheoretical Computer Science :
_b7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings /
_cedited by Jos C. M. Baeten, Tom Ball, Frank S. Boer.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2012.
300 _ax, 393 páginas 76 ilustraciones
_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 ;
_v7604
500 _aSpringer eBooks
505 0 _aComputability and Non-computability Issues in Amorphous Computing -- Static Single Information Form for Abstract Compilation.- Input-Driven Stack Automata.- Probabilistic Inference and Monadic Second Order Logic.- Cinderella versus the Wicked Stepmother.- Worst- and Average-Case Privacy Breaches in Randomization Mechanisms.- Weak Bisimulations for Coalgebras over Ordered Functors.- A Context-Free Linear Ordering with an Undecidable First-Order Theory.- Open Bisimulation for Quantum Processes.- A Modular LTS for Open Reactive Systems.- Unidirectional Channel Systems Can Be Tested.- On Properties and State Complexity of Deterministic State-Partition Automata.- On Union-Free and Deterministic Union-Free Languages.- A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions.- Formal Verification of Distributed Algorithms: From Pseudo Code to Checked Proofs.- A Temporal Logic for Multi-threaded Programs.- The Algorithmic Complexity of k-Domatic Partition of Graphs.- Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics.- Modal Interface Automata.- Proofs as Executions.- Efficient Algorithms for the max k-vertex cover Problem.- A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words..- Compositional Abstraction Techniques for Probabilistic Automata -- Broadcast Abstraction in a Stochastic Calculus for Mobile Networks.- An Intersection Type System for Deterministic Pushdown Automata.- An Output-Based Semantics of ?? with Explicit Substitution in the ?-Calculus: Extended Abstract. Static Single Information Form for Abstract Compilation.- Input-Driven Stack Automata.- Probabilistic Inference and Monadic Second Order Logic.- Cinderella versus the Wicked Stepmother.- Worst- and Average-Case Privacy Breaches in Randomization Mechanisms.- Weak Bisimulations for Coalgebras over Ordered Functors.- A Context-Free Linear Ordering with an Undecidable First-Order Theory.- Open Bisimulation for Quantum Processes.- A Modular LTS for Open Reactive Systems.- Unidirectional Channel Systems Can Be Tested.- On Properties and State Complexity of Deterministic State-Partition Automata.- On Union-Free and Deterministic Union-Free Languages.- A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions.- Formal Verification of Distributed Algorithms: From Pseudo Code to Checked Proofs.- A Temporal Logic for Multi-threaded Programs.- The Algorithmic Complexity of k-Domatic Partition of Graphs.- Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics.- Modal Interface Automata.- Proofs as Executions.- Efficient Algorithms for the max k-vertex cover Problem.- A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words..- Compositional Abstraction Techniques for Probabilistic Automata -- Broadcast Abstraction in a Stochastic Calculus for Mobile Networks.- An Intersection Type System for Deterministic Pushdown Automata.- An Output-Based Semantics of ?? with Explicit Substitution in the ?-Calculus: Extended Abstract.
520 _aThis book constitutes the refereed proceedings of the 7th FIP WG 2.2 International Conference, TCS 2012, held in Amsterdam, The Netherlands, in September 2012. The 25 revised full papers presented, together with one invited talk, were carefully reviewed and selected from 48 submissions. New results of computation theory are presented and more broadly experts in theoretical computer science meet to share insights and ask questions about the future directions of the field.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aBall, Tom.
_eeditor.
_9345692
700 1 _aBoer, Frank S.
_eeditor.
_9321957
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783642334740
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-33475-7
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c306418
_d306418