scientific article; zbMATH DE number 7559498

DOI10.4230/LIPICS.CONCUR.2020.42MaRDI QIDQ5089309zbMATH OpenFDO

Authors Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski

Publication date 18 July 2022

Full work available at URL https://arxiv.org/abs/2007.09340

zbMATH Keywords

timed automatadeterminisationdeterministic membership problem

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• scientific article; zbMATH DE number 1303059 (Why is no real title available?)
• scientific article; zbMATH DE number 1361127 (Why is no real title available?)
• scientific article; zbMATH DE number 7649924 (Why is no real title available?)
• A Machine-Independent Characterization of Timed Languages
• A Second Course in Formal Languages and Automata Theory
• A game approach to determinize timed automata
• A theory of timed automata
• Alternating timed automata
• Analyzing timed systems using tree automata
• Better abstractions for timed automata
• Bisimulation Finiteness of Pushdown Systems Is Elementary
• CONCUR 2005 – Concurrency Theory
• Effective definability of the reachability relation in timed automata
• Event-clock automata: a determinizable class of timed automata
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Folk theorems on the determinization and minimization of timed automata
• Foundations of Software Science and Computation Structures
• Foundations of Software Science and Computational Structures
• Minimum-Time Reachability in Timed Games
• On the decidability and complexity of Metric Temporal Logic over finite words
• Petri nets and regular languages
• Reachability in timed automata with diagonal constraints
• Reachability in two-clock timed automata is PSPACE-complete
• Regularity Problems for Visibly Pushdown Languages
• Regularity and Related Problems for Deterministic Pushdown Automata
• Time to learn -- learning timed automata from tests
• Timed Automata with Integer Resets: Language Inclusion and Expressiveness
• Timed Basic Parallel Processes
• Undecidable Problems About Timed Automata
• Undecidable problems in unreliable computations.
• When Are Timed Automata Determinizable?

Cited in

(6)

• Event-clock automata: a determinizable class of timed automata
• The efficiency of identifying timed automata and the power of clocks
• scientific article; zbMATH DE number 7566065 (Why is no real title available?)
• One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
• CONCUR 2004 - Concurrency Theory
• On parametric timed automata and one-counter machines

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089309)