Operations on timed scenarios
From MaRDI portal
Publication:6535464
DOI10.1007/978-3-031-35355-0_7zbMATH Open1543.6825MaRDI QIDQ6535464
Neda Saeedloei, Feliks Kluźniak
Publication date: 11 January 2024
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- A theory of timed automata
- Optimization of timed scenarios
- Minimization of the number of clocks for timed scenarios
- Matching Scenarios with Timing Constraints
- Checking Coverage for Infinite Collections of Timed Scenarios
- When Are Timed Automata Determinizable?
- From Scenarios to Timed Automata
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- Formal Methods for the Design of Real-Time Systems
- Formal Methods in Software and Systems Modeling
- Lectures on Concurrency and Petri Nets
- Automata, Languages and Programming
- Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning
- Timed scenarios: consistency, equivalence and optimization
This page was built for publication: Operations on timed scenarios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535464)
