Checking Coverage for Infinite Collections of Timed Scenarios

DOI10.1007/978-3-540-74407-8_13MaRDI QIDQ3525637zbMATH OpenOpenAlexFDO

Authors S. Akshay, Madhavan Mukund, K. Narayan Kumar

Publication date 18 September 2008

Published in CONCUR 2007 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74407-8_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Model checking time-constrained scenario-based specifications
• Checking conformance for time-constrained scenario-based specifications
• Matching Scenarios with Timing Constraints
• Automata and Logics for Timed Message Sequence Charts
• Adding time to scenarios

Cited in

(9)

• Minimization of the number of clocks for timed scenarios
• Checking conformance for time-constrained scenario-based specifications
• Model checking time-constrained scenario-based specifications
• Matching Scenarios with Timing Constraints
• Regular set of representatives for time-constrained MSC graphs
• Automata and Logics for Timed Message Sequence Charts
• Operations on timed scenarios
• A local-time semantics for negotiations
• On the existence of unions of timed scenarios

This page was built for publication: Checking Coverage for Infinite Collections of Timed Scenarios

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