scientific article; zbMATH DE number 7559498

DOI10.4230/LIPICS.CONCUR.2020.42MaRDI QIDQ5089309FDOQ5089309

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

Title of this publication is not available (Why is that?)

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

• A theory of timed automata
• When Are Timed Automata Determinizable?
• Title not available (Why is that?)
• On the decidability and complexity of Metric Temporal Logic over finite words
• Minimum-Time Reachability in Timed Games
• Undecidable problems in unreliable computations.
• Regularity and Related Problems for Deterministic Pushdown Automata
• Petri nets and regular languages
• CONCUR 2005 – Concurrency Theory
• Better abstractions for timed automata
• A Second Course in Formal Languages and Automata Theory
• Event-clock automata: a determinizable class of timed automata
• Undecidable Problems About Timed Automata
• Timed Automata with Integer Resets: Language Inclusion and Expressiveness
• Title not available (Why is that?)
• Alternating timed automata
• Foundations of Software Science and Computational Structures
• 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
• Regularity Problems for Visibly Pushdown Languages
• Reachability in two-clock timed automata is PSPACE-complete
• Analyzing timed systems using tree automata
• Title not available (Why is that?)
• Time to learn -- learning timed automata from tests
• A game approach to determinize timed automata
• Reachability in timed automata with diagonal constraints
• Effective definability of the reachability relation in timed automata
• A Machine-Independent Characterization of Timed Languages
• Timed Basic Parallel Processes
• Bisimulation Finiteness of Pushdown Systems Is Elementary

Cited In (6)

• Event-clock automata: a determinizable class of timed automata
• The efficiency of identifying timed automata and the power of clocks
• Title not available (Why is that?)
• 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)