CONCUR '99 : concurrency theory : 10th International Conference, Eindhoven, The Netherlands, August 24 27, 1999 : proceedings
Kaydedildi:
| Müşterek Yazar: | |
|---|---|
| Diğer Yazarlar: | , |
| Materyal Türü: | Livre numérique |
| Dil: | Anglais |
| Baskı/Yayın Bilgisi: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seri Bilgileri: | Lecture notes in computer science
1664 |
| Konular: | |
| Online Erişim: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Not: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • CONCUR '99, concurrency theory, 10th International Conference, Eindhoven, the Netherlands, August 24-27, 1999, proceedings, Jos C.M. Baeten, Sjouke Mauw (eds.), 1999, Berlin, Springer, 1 vol. (XI-572 p.), Lecture notes in computer science, 3-540-66425-4 • CONCUR'99. Concurrency Theory, Texte imprimé, 9783662211533 |
| LEADER | 04613nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 949136 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155215019 | ||
| 020 | |a 9783540483205 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International Conference on Concurrency Theory |n (10 |d :1999 |c :Eindhoven, Pays-Bas). | |
| 245 | 1 | 0 | |a CONCUR '99 : |b concurrency theory : 10th International Conference, Eindhoven, The Netherlands, August 24 27, 1999 : proceedings |c [edited by] Jos C. M. Baeten, Sjouke Mauw. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1664 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited Lectures -- Temporal Process Logic -- An Unfolding Algorithm for Synchronous Products of Transition Systems -- Petri Nets, Configuration Structures and Higher Dimensional Automata -- Expressiveness and Distributed Implementation of Concurrent Calculi with Link Mobility -- Tutorials -- Techniques for Decidability and Undecidability of Bisimilarity -- Testing Concurrent Systems: A Formal Approach -- Accepted Papers -- Computing Minimum and Maximum Reachability Times in Probabilistic Systems -- Automating Modular Verification -- Next Heuristic for On-the-Fly Model Checking -- Model Checking of Message Sequence Charts -- Synthesis of Large Concurrent Programs via Pairwise Composition -- Approximative Symbolic Model Checking of Continuous-Time Markov Chains -- From Synchrony to Asynchrony -- Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic -- Weak and Strong Composition of High-Level Petri Nets -- Model Checking of Time Petri Nets Based on Partial Order Semantics -- Generic Process Algebras for Asynchronous Communication -- Timed Automata and the Theory of Real Numbers -- Metrics for Labeled Markov Systems -- The Expressive Power of Temporal Logic of Actions -- Object Types against Races -- Open Bisimulations on Chi Processes -- Rectangular Hybrid Games -- Localizability of Fairness Constraints and their Distributed Implementations -- Generating Type Systems for Process Graphs -- Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time -- Robust Satisfaction -- Statecharts via Process Algebra -- A Partial Order Event Model for Concurrent Objects -- Partial Order Reduction for Model Checking of Timed Automata -- On the Semantics of Place/Transition Nets -- Validating Firewalls in Mobile Ambients -- On Coherence Properties in Term Rewriting Models ofConcurrency -- Synchronous Structures -- Weakest-Congruence Results for Livelock-Preserving Equivalences -- Proof-Checking Protocols Using Bisimulations -- Event Structures as Presheaves Two Representation Theorems -- Subtyping and Locality in Distributed Higher Order Processes. | |
| 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 Fonctionnement multitâche | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Baeten, Jos C. M., |d 1954- |4 pbd | |
| 700 | 1 | |a Mauw, Sjouke, |d 1961- |4 pbd | |
| 776 | 0 | |0 046456406 |t CONCUR '99 |o concurrency theory |o 10th International Conference, Eindhoven, the Netherlands, August 24-27, 1999 |o proceedings |f Jos C.M. Baeten, Sjouke Mauw (eds.) |d 1999 |c Berlin |n Springer |p 1 vol. (XI-572 p.) |s Lecture notes in computer science |z 3-540-66425-4 | |
| 776 | 0 | |t CONCUR'99. Concurrency Theory |b Texte imprimé |z 9783662211533 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-48320-9 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-670JSHL1-6 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:748057153 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-48320-9 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:751508535 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-48320-9 |z Accès INSA CVL | |
| 997 | |0 949136 |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/ | ||