CONCUR 2003 - concurrency theory : 14th international conference, Marseille, France, September 3-5, 2003 : proceedings
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science
2761 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • CONCUR 2003, concurrency theory, 14th international conference, Marseille, France, September 3-5, 2003, proceedings, Roberto Amadio, Denis Lugiez, eds, Berlin, Springer, 2003, 1 vol. (XI-524 p.), Lecture notes in computer science, 3-540-40753-7 • CONCUR 2003 - Concurrency Theory, Texte imprimé, 9783662172759 |
Inhaltsangabe:
- 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.