Matching Scenarios with Timing Constraints

DOI10.1007/11867340_8MaRDI QIDQ3511226zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Model checking time-constrained scenario-based specifications
• Scenario-Based Timing Consistency Checking for Time Petri Nets
• Adding time to scenarios
• Checking conformance for time-constrained scenario-based specifications
• Checking Coverage for Infinite Collections of Timed Scenarios

Cited in

(12)

• Minimization of the number of clocks for timed scenarios
• Event clock message passing automata: a logical characterization and an emptiness checking algorithm
• Checking conformance for time-constrained scenario-based specifications
• SMT-based scenario verification for hybrid systems
• Model checking time-constrained scenario-based specifications
• Checking Coverage for Infinite Collections of Timed Scenarios
• Adding time to scenarios
• On Scenario Synchronization
• Automata and Logics for Timed Message Sequence Charts
• Timed scenarios: consistency, equivalence and optimization
• Operations on timed scenarios
• On the existence of unions of timed scenarios

Describes a project that uses

Uses Software

• Uppaal

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

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