|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-642-15375-4 |
003 |
DE-He213 |
005 |
20230222024624.0 |
007 |
cr nn 008mamaa |
008 |
100820s2010 gw | s |||| 0|eng d |
020 |
|
|
|a 9783642153754
|9 978-3-642-15375-4
|
024 |
7 |
|
|a 10.1007/978-3-642-15375-4
|2 doi
|
050 |
|
4 |
|a QA76.758
|
072 |
|
7 |
|a UMZ
|2 bicssc
|
072 |
|
7 |
|a COM051230
|2 bisacsh
|
072 |
|
7 |
|a UMZ
|2 thema
|
082 |
0 |
4 |
|a 005.1
|2 23
|
245 |
1 |
0 |
|a CONCUR 2010 - Concurrency Theory
|h [electronic resource] :
|b 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010, Proceedings /
|c edited by Paul Gastin, Francois Laroussinie.
|
250 |
|
|
|a 1st ed. 2010.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2010.
|
300 |
|
|
|a XIII, 600 p. 134 illus.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6269
|
505 |
0 |
|
|a Dating Concurrent Objects: Real-Time Modeling and Schedulability Analysis -- Applications of Shellable Complexes to Distributed Computing -- Concurrency and Composition in a Stochastic World -- Taming Distributed Asynchronous Systems -- Trust in Anonymity Networks -- Learning I/O Automata -- Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification -- Information Flow in Interactive Systems -- From Multi to Single Stack Automata -- A Geometric Approach to the Problem of Unique Decomposition of Processes -- A Logic for True Concurrency -- A Theory of Design-by-Contract for Distributed Multiparty Interactions -- Bisimilarity of One-Counter Processes Is PSPACE-Complete -- Nash Equilibria for Reachability Objectives in Multi-player Timed Games -- Stochastic Real-Time Games with Qualitative Timed Automata Objectives -- Session Types as Intuitionistic Linear Propositions -- Session Types for Access and Information Flow Control -- Simulation Distances -- Mean-Payoff Automaton Expressions -- Obliging Games -- Multipebble Simulations for Alternating Automata -- Parameterized Verification of Ad Hoc Networks -- Termination in Impure Concurrent Languages -- Buffered Communication Analysis in Distributed Multiparty Sessions -- Efficient Bisimilarities from Second-Order Reaction Semantics for ?-Calculus -- On the Use of Non-deterministic Automata for Presburger Arithmetic -- Reasoning about Optimistic Concurrency Using a Program Logic for History -- Theory by Process -- On the Compositionality of Round Abstraction -- A Linear Account of Session Types in the Pi Calculus -- Generic Forward and Backward Simulations II: Probabilistic Simulation -- Kleene, Rabin, and Scott Are Available -- Reversing Higher-Order Pi -- Modal Logic over Higher Dimensional Automata -- A Communication Based Model for Games of Imperfect Information -- Flat Coalgebraic Fixed Point Logics -- Conditional Automata: A Tool for Safe Removal of Negligible Events -- Representations of Petri Net Interactions -- Communicating Transactions -- Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Computer networks .
|
650 |
|
0 |
|a Compilers (Computer programs).
|
650 |
|
0 |
|a Application software.
|
650 |
1 |
4 |
|a Software Engineering.
|
650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
650 |
2 |
4 |
|a Computer Communication Networks.
|
650 |
2 |
4 |
|a Compilers and Interpreters.
|
650 |
2 |
4 |
|a Computer and Information Systems Applications.
|
700 |
1 |
|
|a Gastin, Paul.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Laroussinie, Francois.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642153747
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642153761
|
830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6269
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-15375-4
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|