Checking Coverage for Infinite Collections of Timed Scenarios

DOI10.1007/978-3-540-74407-8_13zbMATH Open1151.68501OpenAlexW1583858366MaRDI QIDQ3525637FDOQ3525637

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

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

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)

Cited In (8)

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

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)