Timed scenarios: consistency, equivalence and optimization

DOI10.1007/978-3-030-03044-5_14MaRDI QIDQ6165894zbMATH OpenOpenAlexFDO

Authors Neda Saeedloei, Feliks Kluźniak

Publication date 2 August 2023

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

Full work available at URL https://doi.org/10.1007/978-3-030-03044-5_14

Mathematics Subject Classification ID

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

Recommendations

• Optimization of timed scenarios
• Synthesizing Clock-Efficient Timed Automata
• From scenarios to timed automata
• Matching Scenarios with Timing Constraints
• Scenario-Based Timing Consistency Checking for Time Petri Nets

Cited in

(9)

• Optimization of timed scenarios
• Three Approaches to Timed External Choice in UTP
• Scenario-Based Timing Consistency Checking for Time Petri Nets
• scientific article; zbMATH DE number 1795716 (Why is no real title available?)
• From scenarios to timed automata
• Synthesizing Clock-Efficient Timed Automata
• Operations on timed scenarios
• On the existence of unions of timed scenarios
• Equivalence between time consistency and nested formula

This page was built for publication: Timed scenarios: consistency, equivalence and optimization

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