Symbolically Bounding the Drift in Time-Constrained MSC Graphs

DOI10.1007/978-3-642-32943-2_1MaRDI QIDQ2915094zbMATH OpenOpenAlexFDO

Authors S. Akshay, Blaise Genest, Loïc Hélouët, Shaofa Yang

Publication date 21 September 2012

Published in Theoretical Aspects of Computing – ICTAC 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32943-2_1

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 5587270
• Regular set of representatives for time-constrained MSC graphs
• On the expressivity of time-varying graphs
• Untangling temporal graphs of bounded degree
• Robust Time-Varying Undirected Graphs
• Tight bounds on distributed exploration of temporal graphs
• A dynamic data structure for MSO properties in graphs with bounded tree-depth
• Assigning times to minimise reachability in temporal graphs
• Mengerian temporal graphs revisited
• New bounds for timed event graphs inspired by stochastic majorization results

Cited in

(3)

• Checking conformance for time-constrained scenario-based specifications
• Regular set of representatives for time-constrained MSC graphs
• scientific article; zbMATH DE number 5587270 (Why is no real title available?)

This page was built for publication: Symbolically Bounding the Drift in Time-Constrained MSC Graphs

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