| 000 | 06027nam a22006135i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-33475-7 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125245.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 120908s2012 gw | s |||| 0|eng d | ||
| 020 |
_a9783642334757 _9978-3-642-33475-7 |
||
| 024 | 7 |
_a10.1007/978-3-642-33475-7 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aUYA _2thema |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 245 | 1 | 0 |
_aTheoretical Computer Science _h[electronic resource] : _b7th IFIP TC1/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. de Boer. |
| 250 | _a1st ed. 2012. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2012. |
|
| 300 |
_aX, 393 p. 76 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v7604 |
|
| 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 CheckedProofs.- 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 ofLanguages 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. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aMachine theory. | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 |
_aComputer science _xMathematics. |
|
| 650 | 0 | _aDiscrete mathematics. | |
| 650 | 1 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aFormal Languages and Automata Theory. |
| 650 | 2 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 | _aMathematics of Computing. |
| 700 | 1 |
_aBaeten, Jos C.M. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aBall, Tom. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_ade Boer, Frank S. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642334740 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642334764 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v7604 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-33475-7 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cSPRINGER | ||
| 999 |
_c175961 _d175961 |
||