Better abstractions for timed automata (Q342707): 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: Q4417927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Concurrency and Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward analysis of updatable timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-checking Timed Temporal Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Optimal Reachability in Weighted Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2911614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Abstractions for Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of real-time systems with discrete probability distributions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Linear Inequalities by Computing Loop Residues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying abstractions of timed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of timed systems using time-abstracting bisimulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic-time DBM-based successor algorithm for checking timed automata / rank
 
Normal rank

Revision as of 23:06, 12 July 2024

scientific article
Language Label Description Also known as
English
Better abstractions for timed automata
scientific article

    Statements

    Identifiers