Share on TelegramCONCUR 2003 : concurrency theory : 14th international conference, Marseille, France, September 3 5, 2003
Author: Amadio, Roberto Informatiker. ger, Amadio, Roberto Informaticien. fre, Amadio, Roberto Computer scientist. eng, International Conference on Concurrency Theory
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: PARALLELVERARBEITUNG + NEBENLÄUFIGKEIT (BETRIEBSSYSTEME), VERTEILTE ALGORITHMEN + PARALLELE ALGORITHMEN (PROGRAMMIERMETHODEN), VERTEILTE PROGRAMMIERUNG + PARALLELE PROGRAMMIERUNG (PROGRAMMIERMETHODEN), TRAITEMENT PARALLELE + SIMULTANÉITÉ (SYSTÈMES D'EXPLOITATION), PARALLEL PROCESSING + CONCURRENCY (OPERATING SYSTEMS), ALGORITHMES DISTRIBUÉS + ALGORITHMES PARALLÈLES (MÉTHODES DE PROGRAMMATION), DISTRIBUTED ALGORITHMS + PARALLEL ALGORITHMS (PROGRAMMING METHODS), PROGRAMMATION DISTRIBUÉE + PROGRAMMATION PARALLÈLE (MÉTHODES DE PROGRAMMATION), CONCURRENT PROGRAMMING + DISTRIBUTED PROGRAMMING + PARALLEL PROGRAMMING (PROGRAMMING METHODS)
Publishers: Berlin : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540407537, 9783540407539
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 294.93 MB
PDF Size: 4.33 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 293
Views: 343
Total Files: 18
Media Type: texts
Total Files: 5
Last Modified: 2022-03-09 09:30:21
Size: 15.47 KB
Description
Author: Roberto Amadio, Denis Lugiez
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-40753-9
DOI: 10.1007/b11938
Table of Contents:
- Distributed Monitoring of Concurrent and Asynchronous Systems
- Synthesis of Distributed Algorithms Using Asynchronous Automata
- Compression of Partially Ordered Strings
- Bundle Event Structures and CCSP
- Syntactic Formats for Free
- Priority Rewrite Systems for OSOS Process Languages
- Quantitative Verification and Control via the Mu-Calculus
- Playing Games with Boxes and Diamonds
- The Element of Surprise in Timed Games
- Deciding Bisimilarity between BPA and BPP Processes
- Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management
- Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic,...
- A Process-Algebraic Language for Probabilistic I/O Automata
- Compositionality for Probabilistic Automata
- Satisfiability and Model Checking for MSO-Definable Temporal Logics Are in PSPACE
- Equivalence Checking of Non-flat Systems Is EXPTIME-Hard
- Model Checking a Path
- Multi-valued Model Checking via Classical Model Checking
- An Extension of Pushdown System and Its Model Checking Method
- Netcharts: Bridging the Gap between HMSCs and Executable Specifications
