Matching Scenarios with Timing Constraints

DOI10.1007/11867340_8zbMath1141.68458OpenAlexW2106307239MaRDI QIDQ3511226

Prakash Chandrasekaran, Madhavan Mukund

Publication date: 8 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11867340_8

Mathematics Subject Classification ID

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

Related Items (5)

Minimization of the number of clocks for timed scenarios ⋮ SMT-based scenario verification for hybrid systems ⋮ Event clock message passing automata: a logical characterization and an emptiness checking algorithm ⋮ Automata and Logics for Timed Message Sequence Charts ⋮ Checking conformance for time-constrained scenario-based specifications

Uses Software

• Uppaal

This page was built for publication: Matching Scenarios with Timing Constraints