Pages that link to "Item:Q5494303"
From MaRDI portal
The following pages link to Formal Methods for the Design of Real-Time Systems (Q5494303):
Displayed 33 items.
- Timed recursive state machines: expressiveness and complexity (Q264999) (← links)
- A survey of timed automata for the development of real-time systems (Q394966) (← links)
- Efficient emptiness check for timed Büchi automata (Q453519) (← links)
- Parameter synthesis for hierarchical concurrent real-time systems (Q488231) (← links)
- Finding minimum and maximum termination time of timed automata models with cyclic behaviour (Q507600) (← links)
- MSO logics for weighted timed automata (Q548692) (← links)
- A Kleene-Schützenberger theorem for weighted timed automata (Q631775) (← links)
- Decision problems for lower/upper bound parametric timed automata (Q1041291) (← links)
- On clock-aware LTL parameter synthesis of timed automata (Q1648651) (← links)
- Unifying behavioral equivalences of timed transition systems (Q1758671) (← links)
- On the determinization of event-clock input-driven pushdown automata (Q2097230) (← links)
- On the complexity of verification of time-sensitive distributed systems (Q2154017) (← links)
- Minimization of the number of clocks for timed scenarios (Q2154053) (← links)
- Untangling the graphs of timed automata to decrease the number of clocks (Q2165509) (← links)
- Model measuring for discrete and hybrid systems (Q2374564) (← links)
- A rewriting framework and logic for activities subject to regulations (Q2973251) (← links)
- Exact Incremental Analysis of Timed Automata with an SMT-Solver (Q3172851) (← links)
- Some Recent Results in Metric Temporal Logic (Q3543284) (← links)
- Timed Automata with Integer Resets: Language Inclusion and Expressiveness (Q3543291) (← links)
- Checking Timed Büchi Automata Emptiness Using LU-Abstractions (Q3648834) (← links)
- On the Supports of Recognizable Timed Series (Q3648835) (← links)
- Learning One-Clock Timed Automata (Q5039523) (← links)
- On the Modeling of Sequential Reactive Systems by Means of Real Time Automata (Q5060075) (← links)
- A menagerie of timed automata (Q5176174) (← links)
- Formal language properties of hybrid systems with strong resets (Q5190079) (← links)
- (Q5376664) (← links)
- A Kleene-Schützenberger Theorem for Weighted Timed Automata (Q5458356) (← links)
- An Introduction to Timed Automata (Q5496927) (← links)
- The tail-recursive fragment of timed recursive CTL (Q6077845) (← links)
- Testing membership for timed automata (Q6090987) (← links)
- Equivalence checking and intersection of deterministic timed finite state machines (Q6108432) (← links)
- An efficient customized clock allocation algorithm for a class of timed automata (Q6113895) (← links)
- Asynchronous correspondences between hybrid trajectory semantics (Q6113973) (← links)