CONCOUR9̉9, concurrency theory : 10th international conference ; Eindhoven, The Netherlands, August 24 27, 1
User Rating: Be the first one!
Author: CONCUR 10 1999 Eindhoven (DE-601)300891830 (DE-588)2178486-3, Baeten, Josephus C. M. (DE-601)283332204, International Conference on Concurrency Theory, CONCUR (10 1999.08.24-27 Eindhoven)
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Nebenläufigkeit, Kongress, Eindhoven <1999>
Publishers: Berlin [u.a.] Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540664254, 9783540664253
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 293.08 MB
PDF Size: 6.97 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 365
Views: 415
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 48320 9 archive t...torrent
Last Modified: 2022-03-09 08:48:58
Download
Size: 15.57 KB
Description
CONCUR’99 Concurrency Theory: 10th International Conference Eindhoven, The Netherlands, August 24—27, 1999 Proceedings
Author: Jos C. M. Baeten, Sjouke Mauw
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66425-3
DOI: 10.1007/3-540-48320-9
Table of Contents:
Literaturangaben
Author: Jos C. M. Baeten, Sjouke Mauw
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66425-3
DOI: 10.1007/3-540-48320-9
Table of Contents:
- Temporal Process Logic
- An Unfolding Algorithm for Synchronous Products of Transition Systems
- Petri Nets, Configuration Structures and Higher Dimensional Automata
- Expressiveness and Distributed Implementation of Concurrent Calculi with Link Mobility
- Techniques for Decidability and Undecidability of Bisimilarity
- Testing Concurrent Systems: A Formal Approach
- Computing Minimum and Maximum Reachability Times in Probabilistic Systems
- Automating Modular Verification
- “Next” Heuristic for On-the-Fly Model Checking
- Model Checking of Message Sequence Charts
- Synthesis of Large Concurrent Programs via Pairwise Composition
- Approximative Symbolic Model Checking of Continuous-Time Markov Chains
- From Synchrony to Asynchrony
- Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic
- Weak and Strong Composition of High-Level Petri Nets
- Model Checking of Time Petri Nets Based on Partial Order Semantics
- Generic Process Algebras for Asynchronous Communication
- Timed Automata and the Theory of Real Numbers
- Metrics for Labeled Markov Systems
- The Expressive Power of Temporal Logic of Actions
Literaturangaben
You May Also Like
We will be happy to hear your thoughts