scientific article; zbMATH DE number 7566065
From MaRDI portal
Publication:5094137
Lorenzo Clemente, Radosław Piórkowski, Sławomir Lasota
Publication date: 2 August 2022
Full work available at URL: https://arxiv.org/abs/2104.03690
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Better abstractions for timed automata
- Folk theorems on the determinization and minimization of timed automata
- Petri nets and regular languages
- Event-clock automata: a determinizable class of timed automata
- A theory of timed automata
- Finite-memory automata
- Undecidable problems in unreliable computations.
- A game approach to determinize timed automata
- Time to learn -- learning timed automata from tests
- Nondeterministic and co-nondeterministic implies deterministic, for data languages
- Effective definability of the reachability relation in timed automata
- Reachability in two-clock timed automata is PSPACE-complete
- Bounded Parikh Automata
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
- Modelling Infinite Structures with Atoms
- Automata theory in nominal sets
- LTL with the freeze quantifier and register automata
- A Machine-Independent Characterization of Timed Languages
- Undecidable Problems About Timed Automata
- Timed Automata with Integer Resets: Language Inclusion and Expressiveness
- A Second Course in Formal Languages and Automata Theory
- A Likelihood-Ratio Test for Identifying Probabilistic Deterministic Real-Time Automata from Positive Data
- When Are Timed Automata Determinizable?
- Regularity and Related Problems for Deterministic Pushdown Automata
- Bisimulation Finiteness of Pushdown Systems Is Elementary
- Finite state machines for strings over infinite alphabets
- Alternating timed automata
- Foundations of Software Science and Computation Structures
- On the decidability and complexity of Metric Temporal Logic over finite words
- Minimum-Time Reachability in Timed Games
- Reachability-Time Games on Timed Automata
- Regularity Problems for Visibly Pushdown Languages
- Foundations of Software Science and Computational Structures
- Timed Basic Parallel Processes
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication:
