×
Loading...

CONCUR 2003 : concurrency theory : 14th international conference, Marseille, France, September 3-5, 2003 by Amadio, Roberto Informatiker. ger

Book Information

TitleCONCUR 2003 : concurrency theory : 14th international conference, Marseille, France, September 3-5, 2003
CreatorAmadio, Roberto Informatiker. ger, Amadio, Roberto Informaticien. fre, Amadio, Roberto Computer scientist. eng, International Conference on Concurrency Theory
Year2003
PPI300
PublisherBerlin : Springer
LanguageEnglish
Mediatypetexts
SubjectPARALLELVERARBEITUNG + 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)
ISBN3540407537, 9783540407539
Collectionfolkscanomy_miscellaneous, folkscanomy, additional_collections
Uploadersketch
Identifierspringer_10.1007-b11938
Telegram icon Share on Telegram
Download Now

Description

CONCUR 2003 - Concurrency Theory: 14th International Conference, Marseille, France, September 3-5, 2003. ProceedingsAuthor: Roberto Amadio, Denis Lugiez Published by Springer Berlin Heidelberg ISBN: 978-3-540-40753-9 DOI: 10.1007/b11938Table 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