Checking conformance for time-constrained scenario-based specifications

DOI10.1016/J.TCS.2015.03.030zbMATH Open1328.68124OpenAlexW2086632956MaRDI QIDQ2355682FDOQ2355682

Paul Gastin, S. Akshay, K. Narayan Kumar, Madhavan Mukund

Publication date: 24 July 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.03.030

zbMATH Keywords

model checkingtimed automataMSC graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A theory of timed automata
• Lectures on Concurrency and Petri Nets
• Formal Modeling and Analysis of Timed Systems
• Semi-commutations
• Timed I/O automata
• Event-clock automata: a determinizable class of timed automata
• Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
• A theory of regular MSC languages
• Model checking time-constrained scenario-based specifications
• Symbolically Bounding the Drift in Time-Constrained MSC Graphs
• Timed Unfoldings for Networks of Timed Automata
• Checking Coverage for Infinite Collections of Timed Scenarios
• Automata and Logics for Timed Message Sequence Charts
• Regular sets of infinite message sequence charts
• Matching Scenarios with Timing Constraints

This page was built for publication: Checking conformance for time-constrained scenario-based specifications

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