Quantitative analysis of communication scenarios

DOI10.1007/978-3-319-22975-1_6MaRDI QIDQ2945583zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Applications of continuous-time Markov processes on discrete state spaces (60J28) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A hierarchy of communication models for message sequence charts
• scientific article; zbMATH DE number 1760052
• Adding time to scenarios
• scientific article; zbMATH DE number 2087438
• Lectures on Concurrency and Petri Nets

Cites work

• scientific article; zbMATH DE number 1629925 (Why is no real title available?)
• scientific article; zbMATH DE number 1701776 (Why is no real title available?)
• scientific article; zbMATH DE number 1307655 (Why is no real title available?)
• scientific article; zbMATH DE number 2081110 (Why is no real title available?)
• scientific article; zbMATH DE number 1754636 (Why is no real title available?)
• scientific article; zbMATH DE number 1418329 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A Compositional Approach to Performance Modelling
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• An event structure based semantics for high-level message sequence charts
• CSL Model Checking Algorithms for Infinite-State Structured Markov Chains
• Causal message sequence charts
• Model checking for action-based logics
• Model checking time-constrained scenario-based specifications
• Regular set of representatives for time-constrained MSC graphs
• Sliding Window Abstraction for Infinite Markov Chains
• The theory of message sequence charts
• Time-bounded model checking of infinite-state continuous-time Markov chains
• Timed semantics of message sequence charts based on timed automata

Cited in

(2)

• Automated Analysis of Discrete Communication Behavior
• An operational semantics for shared messaging communication

This page was built for publication: Quantitative analysis of communication scenarios

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945583)