1 option
CONCUR 2003 - Concurrency Theory : 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings / edited by Roberto Amadio, Denis Lugiez.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2761.
- Lecture Notes in Computer Science, 0302-9743 ; 2761
- Language:
- English
- Subjects (All):
- Computer architecture.
- Computer logic.
- Computer networks.
- 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.
- Local Subjects:
- Computer System Implementation.
- Logics and Meanings of Programs.
- Computer Communication Networks.
- Programming Techniques.
- Programming Languages, Compilers, Interpreters.
- Computation by Abstract Devices.
- Physical Description:
- 1 online resource (XI, 524 pages).
- Edition:
- First edition 2003.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
- System Details:
- text file PDF
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-45187-7
- 9783540451877
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.