Removing All Silent Transitions from Timed Automata (Q3648827): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Volume and Entropy of Regular Timed Languages: Analytic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional equations in the theory of dynamic programming. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536359 / 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: Q4514735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Modeling and Analysis of Timed Systems / 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: Verification of Timed Automata via Satisfiability Checking / rank
 
Normal rank

Latest revision as of 06:24, 2 July 2024

scientific article
Language Label Description Also known as
English
Removing All Silent Transitions from Timed Automata
scientific article

    Statements