Quantitative Analysis of Communication Scenarios
DOI10.1007/978-3-319-22975-1_6zbMath1465.68194OpenAlexW2184423337MaRDI QIDQ2945583
Clemens Dubslaff, Christel Baier
Publication date: 14 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22975-1_6
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Applications of continuous-time Markov processes on discrete state spaces (60J28) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular set of representatives for time-constrained MSC graphs
- Causal message sequence charts
- Model checking for action-based logics
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- Timed Semantics of Message Sequence Charts Based on Timed Automata
- Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains
- CSL Model Checking Algorithms for Infinite-State Structured Markov Chains
- Sliding Window Abstraction for Infinite Markov Chains
- An event structure based semantics for high-level message sequence charts
- The Theory of Message Sequence Charts
- A Compositional Approach to Performance Modelling
This page was built for publication: Quantitative Analysis of Communication Scenarios