CONCUR 2003 - Concurrency Theory 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings /

CONCUR 2003 - Concurrency Theory 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings /

Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Amadio, Roberto (Editor, http://id.loc.gov/vocabulary/relators/edt), Lugiez, Denis (Editor, http://id.loc.gov/vocabulary/relators/edt)
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
Edition:1st ed. 2003.
Series:Lecture Notes in Computer Science, 2761
Subjects:
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.
Online Access:Full Text via HEAL-Link
Table of Contents:
  • 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.

Similar Items