Equivalence checking and intersection of deterministic timed finite state machines (Q6108432): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q114226447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601411 / 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: Formal Methods for the Design of Real-Time Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning One-Clock Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2775857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of non-observable actions in timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updatable timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability Results for Timed Automata with Silent Transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4995370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal language properties of hybrid systems with strong resets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Software Design Modeled by Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing ε-transitions in timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing All Silent Transitions from Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing Experiments for Timed Nondeterministic Finite State Machines / 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: Q3396573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable Problems About Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A menagerie of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Event Clock Automata: From Theory to Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing from a stochastic timed system with a fault model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Switching and Finite Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2004 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal testing from timed finite state machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional specification of timed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Verification of Timed Discrete-Event Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Mealy machines with one timer / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: The efficiency of identifying timed automata and the power of clocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Unknown Component Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of timed automata for the development of real-time systems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:04, 1 August 2024

scientific article; zbMATH DE number 7704603
Language Label Description Also known as
English
Equivalence checking and intersection of deterministic timed finite state machines
scientific article; zbMATH DE number 7704603

    Statements

    Equivalence checking and intersection of deterministic timed finite state machines (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers