Checking Coverage for Infinite Collections of Timed Scenarios

DOI10.1007/978-3-540-74407-8_13zbMath1151.68501OpenAlexW1583858366MaRDI QIDQ3525637

K. Narayan Kumar, Madhavan Mukund, S. Akshay

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)

Related Items (3)

Minimization of the number of clocks for timed scenarios ⋮ Regular set of representatives for time-constrained MSC graphs ⋮ Checking conformance for time-constrained scenario-based specifications

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