CONCUR 2002 - concurrency theory : 13th International Conference Brno, Czech Republic, August 20 23, 2002 : proceedings
محفوظ في:
| مؤلف مشترك: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
2421 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • CONCUR 2002, concurrency theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, proceedings, Luboš Brim ... [et al.], Berlin, Springer, 2002, 1 vol. (XII-609 p.), Lecture notes in computer science, 3-540-44043-7 • CONCUR 2002 - Concurrency Theory, Texte imprimé, 9783662196212 |
| LEADER | 04791nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 948732 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155184717 | ||
| 020 | |a 9783540456940 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International Conference on Concurrency Theory |n (13 |d :2002 |c :Brno). | |
| 245 | 1 | 0 | |a CONCUR 2002 - concurrency theory : |b 13th International Conference Brno, Czech Republic, August 20 23, 2002 : proceedings |c [edited by] Luboš Brim, Petr Jancar, Mojmír Křetínský... [et al.]. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2421 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited Talks -- Refinement and Verification Applied to an In-Flight Data Acquisition Unit* -- A Deductive Proof System for CTL* -- Event-State Duality: The Enriched Case -- Expressive Power of Temporal Logics -- Types, or: Where s the Difference Between CCS and ?? -- Invited Tutorials -- to Modal and Temporal Mu-Calculi -- Types for Cryptographic Protocols -- Verification, Model Checking -- Network Invariants in Action* -- Regular Model Checking Made Simple and Effcient* -- A Hierarchy of Polynomial-Time Computable Simulations for Automata -- A Decidable Class of Asynchronous Distributed Controllers -- Alphabet-Based Synchronisation is Exponentially Cheaper -- Safe Realizability of High-Level Message Sequence Charts* -- Widening the Boundary between Decidable and Undecidable Hybrid Systems* -- Logic -- A Spatial Logic for Concurrency (Part II) -- Reducing Model Checking from Multi-valued CTL* to CTL* -- Local Model Checking Games for Fixed Point Logic with Chop -- A Decidable Fixpoint Logic for Time-Outs* -- Mobility -- A Calculus of Mobile Resources* -- Using Ambients to Control Resources* -- Typing and Subtyping Mobility in Boxed Ambients* -- Orchestrating Transactions in Join Calculus* -- Probabilistic Systems -- Simulation for Continuous-Time Markov Chains -- Weak Bisimulation is Sound and Complete for PCTL* -- Decision Algorithms for Probabilistic Bisimulation* -- Models of Computation, Process Algebra -- Axiomatizing an Algebra of Step Reactions for Synchronous Languages -- Regular Sets of Pomsets with Autoconcurrency -- The Fusion Machine -- HOPLA A Higher-Order Process Language -- A First Order Coalgebraic Model of ?-Calculus Early Observational Equivalence* -- Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes -- Security -- A Framework for the Analysis of SecurityProtocols* -- On Name Generation and Set-Based Analysis in the Dolev-Yao Model -- On the Decidability of Cryptographic Protocols with Open-Ended Data Structures -- Petri Nets -- Causality Semantics of Petri Nets with Weighted Inhibitor Arcs -- Refinement-Robust Fairness -- Bisimulation -- Decidability of Strong Bisimilarity for Timed BPP -- Undecidability of Weak Bisimilarity for Pushdown Processes -- Why Is Simulation Harder than Bisimulation?. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Langages de programmation | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Réseaux d'ordinateurs | ||
| 650 | |a Parallélisme (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Jančar, Petr, |d 19..- |4 pbd | |
| 700 | 1 | |a Křetínský, Mojmír, |d 1950- |4 pbd | |
| 700 | 1 | |a Brim, Luboš, |d 19..- |4 pbd | |
| 776 | 0 | |0 069511373 |t CONCUR 2002 |o concurrency theory |o 13th International Conference, Brno, Czech Republic, August 20-23, 2002 |o proceedings |f Luboš Brim ... [et al.] |c Berlin |n Springer |d 2002 |p 1 vol. (XII-609 p.) |s Lecture notes in computer science |z 3-540-44043-7 | |
| 776 | 0 | |t CONCUR 2002 - Concurrency Theory |b Texte imprimé |z 9783662196212 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-45694-5 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-X10ZSBR1-5 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:748058648 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-45694-5 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:751510084 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-45694-5 |z Accès INSA CVL | |
| 997 | |0 948732 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||