Share on TelegramCONCUR 2000 concurrency theory : 11th international conference, University Park, PA, USA, August 22 25, 2000
User Rating: Be the first one!
Author: Palamidessi, Catuscia, International Conference on Concurrency Theory (11 : University Park, Pa.) : 2000
Added by: sketch
Added Date: 2015-12-30
Language: eng
Publishers: Berlin : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540678972, 9783540678977
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 287.66 MB
PDF Size: 7.27 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Edition: [Elektronische Ressource]
Downloads: 245
Views: 295
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 44618 4 archive t...torrent
Last Modified: 2022-03-09 10:23:01
Download
Size: 15.35 KB
Description
CONCUR 2000 — Concurrency Theory: 11th International Conference University Park, PA, USA, August 22–25, 2000 Proceedings
Author: Catuscia Palamidessi
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67897-7
DOI: 10.1007/3-540-44618-4
Table of Contents:
Author: Catuscia Palamidessi
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67897-7
DOI: 10.1007/3-540-44618-4
Table of Contents:
- Combining Theorem Proving and Model Checking through Symbolic Analysis
- Verification Is Experimentation!
- Compositional Performance Analysis Using Probabilistic I/O Automata
- Formal Models for Communication-Based Design
- Programming Access Control: The Klaim Experience
- Exploiting Hierarchical Structure for Efficient Formal Verification
- From Process Calculi to Process Frameworks
- Verification Using Tabled Logic Programming
- Open Systems in Reactive Environments: Control and Synthesis
- Model Checking with Finite Complete Prefixes Is PSPACE-Complete
- Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
- The Impressive Power of Stopwatches
- Optimizing Büchi Automata
- Generalized Model Checking: Reasoning about Partial State Spaces
- Reachability Analysis for Some Models of Infinite-State Transition Systems
- Process Spaces
- Failure Semantics for the Exchange of Information in Multi-Agent Systems
- Proof-Outlines for Threads in Java
- Deriving Bisimulation Congruences for Reactive Systems
- Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic
You May Also Like
We will be happy to hear your thoughts
