| Regular Model Checking with Regular Relations | 0 | 0.34 | 2021 |
| Generalizing Non-punctuality for Timed Temporal Logic with Freeze Quantifiers | 0 | 0.34 | 2021 |
| SD-Regular Transducer Expressions for Aperiodic Transformations | 0 | 0.34 | 2021 |
| The Decidability of Verification under PS 2.0 | 0 | 0.34 | 2021 |
| Synthesis of Computable Regular Functions of Infinite Words. | 0 | 0.34 | 2020 |
| On the Separability Problem of String Constraints | 0 | 0.34 | 2020 |
| Containment of Simple Conjunctive Regular Path Queries. | 0 | 0.34 | 2020 |
| Robust Controller Synthesis for Duration Calculus. | 0 | 0.34 | 2020 |
| On Timed Scope-bounded Context-sensitive Languages. | 0 | 0.34 | 2019 |
| Deciding the Computability of Regular Functions over Infinite Words. | 0 | 0.34 | 2019 |
| Timed Systems through the Lens of Logic | 1 | 0.37 | 2019 |
| Verification of programs under the release-acquire semantics | 2 | 0.36 | 2019 |
| On Synthesis of Resynchronizers for Transducers. | 0 | 0.34 | 2019 |
| Logics Meet 1-Clock Alternating Timed Automata. | 0 | 0.34 | 2018 |
| Regular Transducer Expressions for Regular Transformations. | 1 | 0.36 | 2018 |
| Verification of Timed Asynchronous Programs. | 0 | 0.34 | 2018 |
| Büchi-Kamp Theorems for 1-clock ATA. | 0 | 0.34 | 2018 |
| Regular and First Order List Functions. | 0 | 0.34 | 2018 |
| Perfect Timed Communication Is Hard. | 1 | 0.35 | 2018 |
| Regular and First-Order List Functions. | 0 | 0.34 | 2018 |
| Unambiguous Forest Factorization. | 0 | 0.34 | 2018 |
| What is Decidable about Perfect Timed Channels? | 0 | 0.34 | 2017 |
| The Reach-Avoid Problem for Constant-Rate Multi-Mode Systems. | 1 | 0.34 | 2017 |
| Towards an Efficient Tree Automata based technique for Timed Systems. | 1 | 0.35 | 2017 |
| Making Metric Temporal Logic Rational. | 1 | 0.35 | 2017 |
| Further results on generalised communicating P systems. | 1 | 0.38 | 2017 |
| Traceability Analyses between Features and Assets in Software Product Lines. | 2 | 0.37 | 2016 |
| Analyzing Timed Systems Using Tree Automata. | 2 | 0.37 | 2016 |
| Stochastic Timed Games Revisited. | 1 | 0.36 | 2016 |
| On Nonlinear Prices In Timed Automata | 1 | 0.38 | 2016 |
| A Logical Characterization for Dense-Time Visibly Pushdown Automata. | 2 | 0.38 | 2016 |
| Mean-Payoff Games on Timed Automata. | 0 | 0.34 | 2016 |
| A Perfect Class of Context-Sensitive Timed Languages. | 2 | 0.38 | 2016 |
| FO-definable transformations of infinite strings. | 1 | 0.36 | 2016 |
| Metric Temporal Logic with Counting. | 0 | 0.34 | 2016 |
| Reachability Games on Recursive Hybrid Automata | 1 | 0.35 | 2015 |
| On Pure Nash Equilibria in Stochastic Games. | 1 | 0.37 | 2015 |
| What's decidable about recursive hybrid automata? | 4 | 0.44 | 2015 |
| Compositional modeling and analysis of automotive feature product lines | 2 | 0.38 | 2015 |
| Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable. | 0 | 0.34 | 2015 |
| Revisiting Robustness in Priced Timed Games. | 0 | 0.34 | 2015 |
| Hybrid Automata for Formal Modeling and Verification of Cyber-Physical Systems | 4 | 0.58 | 2015 |
| Metric Temporal Logic with Counting | 2 | 0.37 | 2015 |
| Adding Negative Prices to Priced Timed Games. | 4 | 0.42 | 2014 |
| Partially Punctual Metric Temporal Logic is Decidable | 1 | 0.37 | 2014 |
| On The Reachability Problem for Recursive Hybrid Automata with One and Two Players. | 1 | 0.38 | 2014 |
| A Cost Effective Approach for Analyzing Software Product Lines | 0 | 0.34 | 2014 |
| First-order Definable String Transformations. | 9 | 0.53 | 2014 |
| On Unary Fragments of MTL and TPTL over Timed Words. | 0 | 0.34 | 2014 |
| Improved Undecidability Results For Reachability Games On Recursive Timed Automata | 2 | 0.39 | 2014 |
