000 | 05050nam a22005775i 4500 | ||
---|---|---|---|
001 | 978-3-642-04081-8 | ||
003 | DE-He213 | ||
005 | 20240730190217.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2009 gw | s |||| 0|eng d | ||
020 |
_a9783642040818 _9978-3-642-04081-8 |
||
024 | 7 |
_a10.1007/978-3-642-04081-8 _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 |
_aCONCUR 2009 - Concurrency Theory _h[electronic resource] : _b20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009, Proceedings / _cedited by Mario Bravetti, Gianluigi Zavattaro. |
250 | _a1st ed. 2009. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2009. |
|
300 |
_aXIII, 638 p. _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 ; _v5710 |
|
505 | 0 | _aInvited Papers -- Perspectives on Transactional Memory -- The Effect of Tossing Coins in Omega-Automata -- Bigraphical Categories -- BlenX Static and Dynamic Semantics -- Contributed Papers -- Flow Policy Awareness for Distributed Mobile Code -- Volume and Entropy of Regular Timed Languages: Discretization Approach -- A Logical Interpretation of the ?-Calculus into the ?-Calculus, Preserving Spine Reduction and Types -- Encoding Asynchronous Interactions Using Open Petri Nets -- Distributed Asynchronous Automata -- Algebra for Infinite Forests with an Application to the Temporal Logic EF -- Deriving Syntax and Axioms for Quantitative Regular Behaviours -- Weighted Bisimulation in Linear Algebraic Form -- A Logic-Based Framework for Reasoning about Composite Data Structures -- Measuring Permissivity in Finite Games -- Contracts for Mobile Processes -- Power of Randomization in Automata on Infinite Strings -- Probabilistic Weighted Automata -- Partially-Commutative Context-Free Processes -- Testing Finitary Probabilistic Processes -- A Demonic Approach to Information in Probabilistic Systems -- HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour -- Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs -- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers -- Model-Checking Games for Fixpoint Logics with Partial Order Models -- Reachability in Succinct and Parametric One-Counter Automata -- Winning Regions of Pushdown Parity Games: A Saturation Method -- Concurrent Kleene Algebra -- Concavely-Priced Probabilistic Timed Automata -- Compositional Control Synthesis for Partially Observable Systems -- Howe's Method for Calculi with Passivation -- On the Relationship between ?-Calculus and Finite Place/Transition Petri Nets -- ModelingRadio Networks -- Time-Bounded Verification -- Secure Enforcement for Global Process Specifications -- On Convergence of Concurrent Systems under Regular Interactions -- Computing Stuttering Simulations -- Weak Time Petri Nets Strike Back! -- A General Testability Theory -- Counterexamples in Probabilistic LTL Model Checking for Markov Chains -- Query-Based Model Checking of Ad Hoc Network Protocols -- Strict Divergence for Probabilistic Timed Automata. | |
520 | _aThis book constitutes the refereed proceedings of the 20th International Conference on Concurrency Theory, CONCUR 2009, held in Bologna, Italy, September 1-4, 2009. The 37 revised full papers presented together with four invited papers were carefully reviewed and selected from 129 submissions. The topics include model checking, process calculi, minimization and equivalence checking, types, semantics, probability, bisimulation and simulation, real time, and formal languages. | ||
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aComputer programming. _94169 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 1 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
650 | 2 | 4 |
_aProgramming Techniques. _9141688 |
650 | 2 | 4 |
_aTheory of Computation. _9141689 |
650 | 2 | 4 |
_aModels of Computation. _931806 |
650 | 2 | 4 |
_aMathematics of Computing. _931875 |
700 | 1 |
_aBravetti, Mario. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9141690 |
|
700 | 1 |
_aZavattaro, Gianluigi. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9141691 |
|
710 | 2 |
_aSpringerLink (Online service) _9141692 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642040801 |
776 | 0 | 8 |
_iPrinted edition: _z9783642040825 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5710 _9141693 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-04081-8 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c93141 _d93141 |