A survey of timed automata for the development of real-time systems (Q394966): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Tempo / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CMC / 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.1016/j.cosrev.2013.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091661303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-checking in dense real-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472228 / 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: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Concurrency and Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking timed Büchi automata emptiness efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking timed Büchi automata emptiness on simulation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal methods and software engineering. 5th international conference on formal engineering methods, ICFEM 2003, Singapore, November 5--7, 2003. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward analysis of updatable 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: Timed regular expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4807830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396582 / 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: Minimum and maximum delay problems in real-time systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-abstracted bisimulation: Implicit specifications and decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying abstractions of timed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable Problems About Timed Automata / 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: Q4270062 / 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: Q4552456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Task automata: Schedulability, decidability and undecidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On probabilistic 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: Pushdown timed automata: A binary reachability characterization and safety verification. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updatable timed automata / 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: Q4514735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timed automata and additive clock constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric real-time reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769587 / 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: Model checking weighted integer reset timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Time-Asynchronous Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Timed Automata with Independently Evolving Clocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interrupt Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal reachability for multi-priced timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concavely-Priced Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concavely-Priced Probabilistic Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timed P Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superposition-Based Analysis of First-Order Probabilistic Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communicating Timed Automata: The More Synchronous, the More Difficult to Verify / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Verification of Multi-queue Discrete Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification in loosely synchronous queue-connected discrete timed automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507819 / 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: Q4501664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Continuous Timed Automata with Input-Determined Guards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counter-Free Input-Determined Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Event-Clock Visibly Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Past pushdown timed automata and safety verification. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Technology for Verification and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timed automata with urgent transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Alternating Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the synthesis of discrete controllers for timed systems / 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: Removing ε-transitions in timed automata / 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: Decision problems for lower/upper bound parametric timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric temporal logic for “model measuring” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Model-Checking: Parameters everywhere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric timing analysis for real-time systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: HyTech: A model checker for hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Model Checking with VerICS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5437180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: State equivalences for rectangular hybrid automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5714448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages and Tools for Hybrid Systems Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal reachability problem of weighted timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Methods for Components and Objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2920149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-Checking One-Clock Priced Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Costs Are Expensive! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with membranes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membrane Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking for probabilistic timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statecharts: a visual formalism for complex systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and verification of long-running transactions in a timed framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2775864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of bounded concurrency I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Logical Characterisation of Event Clock Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly pushdown languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938632 / 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: Complexity of some problems in Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer aided verification. 19th international conference, CAV 2007, Berlin, Germany, July 3--7, 2007. Proceedings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Time Reachability in Timed Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-time control for rectangular hybrid automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability-Time Games on Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Robustness Analysis of Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical Properties of Timed Automata Revisited / 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: Quantitative Robustness Analysis of Flat Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Specification of Real Time Components / 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: Sampled Semantics of Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timed Automata Can Always Be Made Implementable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251920 / 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: Q4493880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551173 / 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: Validation and verification of web services choreographies by using timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2848144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939617 / rank
 
Normal rank

Latest revision as of 06:35, 7 July 2024

scientific article
Language Label Description Also known as
English
A survey of timed automata for the development of real-time systems
scientific article

    Statements

    A survey of timed automata for the development of real-time systems (English)
    0 references
    0 references
    0 references
    0 references
    28 January 2014
    0 references
    timed automata
    0 references
    survey
    0 references
    real-time systems
    0 references
    formal models
    0 references
    semantics
    0 references
    timed regular languages
    0 references
    decision problems
    0 references
    variants
    0 references
    implementability
    0 references
    tools
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references