Vai al contenuto principale della pagina
Titolo: |
CONCUR 2003 - Concurrency Theory : 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings / / edited by Roberto Amadio, Denis Lugiez
![]() |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
Edizione: | 1st ed. 2003. |
Descrizione fisica: | 1 online resource (XI, 524 p.) |
Disciplina: | 004.35 |
Soggetto topico: | Architecture, Computer |
Computer logic | |
Computer communication systems | |
Computer programming | |
Programming languages (Electronic computers) | |
Computers | |
Computer System Implementation | |
Logics and Meanings of Programs | |
Computer Communication Networks | |
Programming Techniques | |
Programming Languages, Compilers, Interpreters | |
Computation by Abstract Devices | |
Persona (resp. second.): | AmadioRoberto |
LugiezDenis | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | Partial Orders and Asynchronous Systems -- Distributed Monitoring of Concurrent and Asynchronous Systems -- Synthesis of Distributed Algorithms Using Asynchronous Automata -- Compression of Partially Ordered Strings -- Process Algebra -- Bundle Event Structures and CCSP -- Syntactic Formats for Free -- Priority Rewrite Systems for OSOS Process Languages -- Games -- Quantitative Verification and Control via the Mu-Calculus -- Playing Games with Boxes and Diamonds -- The Element of Surprise in Timed Games -- Infinite Systems -- Deciding Bisimilarity between BPA and BPP Processes -- Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management -- Probabilistic Automata -- Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic,... -- A Process-Algebraic Language for Probabilistic I/O Automata -- Compositionality for Probabilistic Automata -- Model-Checking -- 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 -- Model-Checking and HMSC -- 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 -- High-Level Message Sequence Charts and Projections -- Security -- Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus -- Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions -- Contract Signing, Optimism, and Advantage -- Mobility -- Full Abstraction for HOPLA -- Modeling Consensus in a Process Calculus -- Linear Forwarders -- Compositional Methods and Real Time -- Abstract Patterns of Compositional Reasoning -- Relating Fairness and Timing in Process Algebras -- A Compositional Semantic Theory for Synchronous Component-Based Design -- Probabilistic Models -- Conditional Expectation and the Approximation of Labelled Markov Processes -- Comparative Branching-Time Semantics for Markov Chains -- Quantitative Relations and Approximate Process Equivalences. |
Titolo autorizzato: | CONCUR 2003 - concurrency theory ![]() |
ISBN: | 3-540-45187-0 |
Formato: | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 9910144026803321 |
Lo trovi qui: | Univ. Federico II |
Opac: | Controlla la disponibilità qui |