Pages that link to "Item:Q1401320"
From MaRDI portal
The following pages link to Pushdown timed automata: A binary reachability characterization and safety verification. (Q1401320):
Displaying 20 items.
- Timed recursive state machines: expressiveness and complexity (Q264999) (← links)
- Quantifying communication in synchronized languages (Q344766) (← links)
- Similarity in languages and programs (Q391201) (← links)
- A survey of timed automata for the development of real-time systems (Q394966) (← links)
- Linear reachability problems and minimal solutions to linear Diophantine equation systems (Q703515) (← links)
- Reachability results for timed automata with unbounded data structures (Q707597) (← links)
- Fast zone-based algorithms for reachability in pushdown timed automata (Q832208) (← links)
- Execution information rate for some classes of automata (Q899317) (← links)
- Dense-choice counter machines revisited (Q2015129) (← links)
- Reachability relations of timed pushdown automata (Q2221811) (← links)
- Effective definability of the reachability relation in timed automata (Q2338218) (← links)
- Sampling automata and programs (Q2339473) (← links)
- Information rate of some classes of non-regular languages: an automata-theoretic approach (Q2407088) (← links)
- On composition and lookahead delegation of \(e\)-services modeled by automata (Q2566017) (← links)
- Logics for Weighted Timed Pushdown Automata (Q2947171) (← links)
- Security of Numerical Sensors in Automata (Q2947411) (← links)
- A Logical Characterization of Timed Pushdown Languages (Q3194716) (← links)
- Quantifying Communication in Synchronized Languages (Q3196422) (← links)
- (Q5002803) (← links)
- Lossiness of communication channels modeled by transducers1 (Q5283445) (← links)
