Timed Automata Can Always Be Made Implementable (Q3090823): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Kim Guldstrand Larsen / rank
Normal rank
 
Property / author
 
Property / author: Kim Guldstrand Larsen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2196692106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampled Semantics of Timed Automata / 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: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic and Topological Semantics for Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Model-Checking of Linear-Time Properties in Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Analysis of Timed Automata Via Channel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust safety of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost ASAP semantics: from timed models to timed implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2970258 / 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: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical properties of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative analysis of weighted transition systems / rank
 
Normal rank

Latest revision as of 11:02, 4 July 2024

scientific article
Language Label Description Also known as
English
Timed Automata Can Always Be Made Implementable
scientific article

    Statements

    Timed Automata Can Always Be Made Implementable (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2011
    0 references
    0 references
    0 references