The following pages link to Karin Quaas (Q548691):
Displaying 35 items.
- MSO logics for weighted timed automata (Q548692) (← links)
- A Kleene-Schützenberger theorem for weighted timed automata (Q631775) (← links)
- (Q1944932) (redirect page) (← links)
- Recognizability of the support of recognizable series over the semiring of the integers is undecidable (Q1944933) (← links)
- The containment problem for unambiguous register automata and unambiguous timed automata (Q2048204) (← links)
- Computing branching distances with quantitative games (Q2210522) (← links)
- Computing branching distances using quantitative games (Q2279111) (← links)
- Effective definability of the reachability relation in timed automata (Q2338218) (← links)
- Parameterized model checking of weighted networks (Q2447757) (← links)
- On the Interval-Bound Problem for Weighted Timed Automata (Q3004604) (← links)
- Verification for Timed Automata Extended with Unbounded Discrete Data Structures (Q3190139) (← links)
- Verification for Timed Automata extended with Unbounded Discrete Data Structures (Q3196352) (← links)
- Path Checking for MTL and TPTL over Data Words (Q3451113) (← links)
- Zone-Based Universality Analysis for Single-Clock Timed Automata (Q3508519) (← links)
- (Q3574978) (← links)
- (Q3601411) (← links)
- Weighted Timed MSO Logics (Q3637244) (← links)
- On the Supports of Recognizable Timed Series (Q3648835) (← links)
- Synchronizing Data Words for Register Automata (Q4608573) (← links)
- Model Checking Metric Temporal Logic over Automata with One Counter (Q4910485) (← links)
- (Q4972731) (← links)
- (Q4994943) (← links)
- (Q4994958) (← links)
- The Containment Problem for Unambiguous Register Automata (Q5090504) (← links)
- The Complexity of Flat Freeze LTL (Q5111647) (← links)
- (Q5144644) (← links)
- Kleene Algebras and Semimodules for Energy Problems (Q5166679) (← links)
- MTL and TPTL for One-Counter Machines (Q5216144) (← links)
- Synchronizing Data Words for Register Automata (Q5222876) (← links)
- An Algebraic Approach to Energy Problems I — <sup>*</sup>-Continuous Kleene ω-Algebras (Q5350155) (← links)
- An Algebraic Approach to Energy Problems II — The Algebra of Energy Functions (Q5350156) (← links)
- Satisfiability for MTL and TPTL over Non-monotonic Data Words (Q5404916) (← links)
- A Kleene-Schützenberger Theorem for Weighted Timed Automata (Q5458356) (← links)
- First steps towards taming description logics with strings (Q6545544) (← links)
- Deciding emptiness for constraint automata on strings with the prefix and suffix order (Q6584082) (← links)
