TY  - BOOK
AU  - Amadio,Roberto
AU  - Lugiez,Denis
ED  - International Conference on Concurrency Theory.
TI  - CONCUR 2003 - Concurrency Theory: 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings
T2  - Lecture Notes in Computer Science,
SN  - 3540407537
AV  - QA76.9.A73 
U1  - 003.3 23
PY  - 2003///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer networks
KW  - Computer architecture
KW  - Computer programming
KW  - Programming languages (Electronic computers)
KW  - Computers
KW  - Computer logic
KW  - Electronic data processing
KW  - Electronic digital computers
KW  - Computer Science
KW  - Computer System Implementation
KW  - Logics and Meanings of Programs
KW  - Computer Communication Networks
KW  - Programming Techniques
KW  - Programming Languages, Compilers, Interpreters
KW  - Computation by Abstract Devices
KW  - Informatique
KW  - Réseaux d'ordinateurs
KW  - Ordinateurs
KW  - Architecture
KW  - Programmation (Informatique)
KW  - Logique informatique
KW  - computer science
KW  - aat
KW  - data processing
KW  - computer programming
KW  - computers
KW  - fast
N1  - 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
N2  - This book constitutes the refereed proceedings of the 14th International Conference on Concurrency Theory, CONCUR 2003, held in Marseille, France in September 2003. The 29 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 107 submissions. The papers are organized in topical sections on partial orders and asynchronous systems, process algebras, games, infinite systems, probabilistic automata, model checking, model checking and HMSC, security, mobility, compositional methods and real time, and probabilistic models
UR  - https://link.springer.com/10.1007/b11938
ER  -