Timed automata: Semantics, algorithms and tools
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A quadratic-time DBM-based successor algorithm for checking timed automata
- On clock-aware LTL parameter synthesis of timed automata
- Event algebra for transition systems composition application to timed automata
- Superposition as a decision procedure for timed automata
- Certifying emptiness of timed Büchi automata
- Dynamic causes for the violation of timed reachability properties
- Zone-based verification of timed automata: extrapolations, simulations and what next?
- Monitoring timed properties (revisited)
- Configurable verification of timed automata with discrete variables
- Waiting nets
- Runtime enforcement of timed properties using games
- Model-checking precision agriculture logistics: the case of the differential harvest
- Timed automata
- Consistency in parametric interval probabilistic timed automata
- Checking conformance for time-constrained scenario-based specifications
- Local abstraction refinement for probabilistic timed programs
- Temporal constraints in the logical analysis of regulatory networks
- A tool for deciding the satisfiability of continuous-time metric temporal logic
- Parameter synthesis for probabilistic timed automata using stochastic game abstractions
- Shrinking timed automata
- Task automata: Schedulability, decidability and undecidability
- Modelling and analysing neural networks using a hybrid process algebra
- Modelling and verification of weighted spiking neural systems
- Timed recursive state machines: expressiveness and complexity
- Formalized timed automata
- A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling
- Timed semantics of message sequence charts based on timed automata
- Automata and temporal logic over arbitrary linear time
- Quantitative attack tree analysis via priced timed automata
- Model-based verification, optimization, synthesis and performance evaluation of real-time systems
- The Theory of Timed I/O Automata
- Exact Incremental Analysis of Timed Automata with an SMT-Solver
- Model Checking Real-Time Systems
- Better abstractions for timed automata
- Solving the time varying postman problems with timed automata
- From safety critical Java programs to timed process models
- Automatic Abstraction Refinement for Timed Automata
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
- Survey on Directed Model Checking
- Efficient on-the-fly algorithm for checking alternating timed simulation
- Checking timed Büchi automata emptiness using LU-abstractions
- Pumping lemmas for timed automata
- A survey of timed automata for the development of real-time systems
- Timed Automata
- Model checking time-dependent system specifications using time stream Petri nets and \texttt{UPPAAL}
- Analyzing Timed Systems Using Tree Automata
- scientific article; zbMATH DE number 2143087 (Why is no real title available?)
- Robust reachability in timed automata and games: a game-based approach
- Parameter synthesis for hierarchical concurrent real-time systems
- A formal approach to the WCRT analysis of multicore systems with memory contention under phase-structured task sets
- Timed alternating tree automata: The automata-theoretic solution to the TCTL model checking problem
- Graph-based models for real-time workload: a survey
- Parametric updates in parametric timed automata
- Timed network games with clocks
- Reachability in timed automata with diagonal constraints
- Verified certification of reachability checking for timed automata
- Finding minimum and maximum termination time of timed automata models with cyclic behaviour
- Reachability and liveness in parametric timed automata
- Towards an Efficient Tree Automata based technique for Timed Systems
- A menagerie of timed automata
- Language preservation problems in parametric timed automata
- Discretization of timed automata in timed CRL à la regions and zones
- A temporal logic for micro- and macro-step-based real-time systems: foundations and applications
- Developments in Language Theory
- Formal Methods for the Design of Real-Time Systems
- Revisiting local time semantics for networks of timed automata
- SetExp: a method of transformation of timed automata into finite state automata
- Bonding calculus
- Aspects of availability. Enforcing timed properties to prevent denial of service
- Control strategies for off-line testing of timed systems
- Automated repair for timed systems
- Distributed parametric model checking timed automata under non-zenoness assumption
- Human-cyber-physical automata and their synthesis
- Temporal Robustness of Stochastic Signals
- Parametric updates in parametric timed automata
- Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic
- Wordgen : a Timed word Generation Tool
- Probabilistic Metric Temporal Graph Logic
- A state class based controller synthesis approach for time Petri nets
- Operations on timed scenarios
- A unified model for real-time systems: symbolic techniques and implementation
- Repairing timed automata clock guards through abstraction and testing
- An efficient state space construction for a class of timed automata
- Simulations for event-clock automata
- Compositional analysis of probabilistic timed graph transformation systems
- Timeout asynchronous session types: safe asynchronous mixed-choice for timed interactions
- Timed automata verification and synthesis via finite automata learning
- On the existence of unions of timed scenarios
- Timers for distributed systems
- Metric quantifiers and counting in timed logics and automata
- Dense integer-complete synthesis for bounded parametric timed automata
- Counterfactual explanations for MITL violations
- Time for timed monitorability
- On-the-fly symbolic algorithm for timed ATL with abstractions
- Efficient monitoring of timed properties
- On-the-fly TCTL model checking for time Petri nets
- Worklist Algorithms
- Parameterized verification of timed networks with clock invariants
- Checking timed bisimilarity with virtual clocks
- Spotlight abstraction in model checking real-time task schedulability
This page was built for publication: Timed automata: Semantics, algorithms and tools
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712294)
