Quantitative analysis of communication scenarios

DOI10.1007/978-3-319-22975-1_6zbMATH Open1465.68194OpenAlexW2184423337MaRDI QIDQ2945583FDOQ2945583

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

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

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)

Cites Work

• Sliding Window Abstraction for Infinite Markov Chains
• Title not available (Why is that?)
• A Compositional Approach to Performance Modelling
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• Model checking time-constrained scenario-based specifications
• Regular set of representatives for time-constrained MSC graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Causal message sequence charts
• Model checking for action-based logics
• Time-bounded model checking of infinite-state continuous-time Markov chains
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An event structure based semantics for high-level message sequence charts
• The theory of message sequence charts
• Title not available (Why is that?)
• Timed semantics of message sequence charts based on timed automata
• CSL Model Checking Algorithms for Infinite-State Structured Markov Chains

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)