Q5089309 (Q5089309): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4643961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Event-clock automata: a determinizable class of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Are Timed Automata Determinizable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity Problems for Visibly Pushdown Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game approach to determinize timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Characterization of Timed Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computational Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Time Reachability in Timed Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timed Basic Parallel Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability in two-clock timed automata is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable Problems About Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective definability of the reachability relation in timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation Finiteness of Pushdown Systems Is Elementary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better abstractions for timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable problems in unreliable computations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decidability and complexity of Metric Temporal Logic over finite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second Course in Formal Languages and Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timed Automata with Integer Resets: Language Inclusion and Expressiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time to learn -- learning timed automata from tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Folk theorems on the determinization and minimization of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity and Related Problems for Deterministic Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets and regular languages / rank
 
Normal rank

Latest revision as of 16:49, 29 July 2024

scientific article; zbMATH DE number 7559498
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7559498

    Statements

    0 references
    0 references
    0 references
    18 July 2022
    0 references
    0 references
    timed automata
    0 references
    determinisation
    0 references
    deterministic membership problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references