Pages that link to "Item:Q1274452"
From MaRDI portal
The following pages link to Event-clock automata: a determinizable class of timed automata (Q1274452):
Displayed 49 items.
- A survey of timed automata for the development of real-time systems (Q394966) (← links)
- On regions and zones for event-clock automata (Q487253) (← links)
- Model checking weighted integer reset timed automata (Q537908) (← links)
- The efficiency of identifying timed automata and the power of clocks (Q553334) (← links)
- Learning of event-recording automata (Q604474) (← links)
- \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability (Q832203) (← links)
- Conformance testing for real-time systems (Q842583) (← links)
- Enzymatic competition: Modeling and verification with timed hybrid Petri nets (Q1013380) (← links)
- The language preservation problem is undecidable for parametric event-recording automata (Q1751409) (← links)
- Weighted register automata and weighted logic on data words (Q1786559) (← links)
- A logical characterization of data languages. (Q1853115) (← links)
- Updatable timed automata (Q1885906) (← links)
- Modal event-clock specifications for timed component-based design (Q1951603) (← links)
- Active learning of timed automata with unobservable resets (Q1996023) (← links)
- A game approach to determinize timed automata (Q2018058) (← links)
- Complexity issues for timeline-based planning over dense time under future and minimal semantics (Q2067619) (← links)
- On the determinization of event-clock input-driven pushdown automata (Q2097230) (← links)
- Context-free timed formalisms: robust automata and linear temporal logics (Q2113377) (← links)
- SMT-based satisfiability of first-order LTL with event freezing functions and metric operators (Q2182731) (← links)
- Reachability relations of timed pushdown automata (Q2221811) (← links)
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm (Q2248059) (← links)
- Checking conformance for time-constrained scenario-based specifications (Q2355682) (← links)
- Monotonic hybrid systems (Q2486564) (← links)
- A Perfect Class of Context-Sensitive Timed Languages (Q2817374) (← links)
- Interval Duration Logic (Q2842590) (← links)
- Timed CSP = Closed Timed Automata1 (Q2842610) (← links)
- Methodologies for Specification of Real-Time Systems Using Timed I/O Automata (Q3066127) (← links)
- Event Clock Automata: From Theory to Practice (Q3172852) (← links)
- Model Checking Real-Time Systems (Q3176387) (← links)
- Weighted Register Automata and Weighted Logic on Data Words (Q3179411) (← links)
- Time-Bounded Verification (Q3184695) (← links)
- (Q3384172) (← links)
- (Q3384894) (← links)
- Timed Automata with Integer Resets: Language Inclusion and Expressiveness (Q3543291) (← links)
- Event-Clock Visibly Pushdown Automata (Q3599103) (← links)
- Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions (Q3618627) (← links)
- Weighted Timed MSO Logics (Q3637244) (← links)
- Realizability of Real-Time Logics (Q3648828) (← links)
- Learning One-Clock Timed Automata (Q5039523) (← links)
- (Q5089309) (← links)
- (Q5094137) (← links)
- Formal language properties of hybrid systems with strong resets (Q5190079) (← links)
- Distributed Event Clock Automata (Q5200069) (← links)
- Automata and Logics for Timed Message Sequence Charts (Q5458842) (← links)
- Compositional Design of Stochastic Timed Automata (Q5740181) (← links)
- Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language (Q5859682) (← links)
- Equivalence checking and intersection of deterministic timed finite state machines (Q6108432) (← links)
- Inferring Symbolic Automata (Q6135753) (← links)
- Active learning of one-clock timed automata using constraint solving (Q6160915) (← links)