Publication:5089309
From MaRDI portal
DOI10.4230/LIPIcs.CONCUR.2020.42MaRDI QIDQ5089309
Sławomir Lasota, Lorenzo Clemente, Radosław Piórkowski
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2007.09340
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Cites Work
- 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
- Undecidable problems in unreliable computations.
- A game approach to determinize timed automata
- Time to learn -- learning timed automata from tests
- Effective definability of the reachability relation in timed automata
- Reachability in two-clock timed automata is PSPACE-complete
- 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
- When Are Timed Automata Determinizable?
- Regularity and Related Problems for Deterministic Pushdown Automata
- Bisimulation Finiteness of Pushdown Systems Is Elementary
- 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
- Regularity Problems for Visibly Pushdown Languages
- Foundations of Software Science and Computational Structures
- Timed Basic Parallel Processes
- CONCUR 2005 – Concurrency Theory
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
