Simulations for event-clock automata
From MaRDI portal
Recommendations
Cites work
- A quadratic-time DBM-based successor algorithm for checking timed automata
- A theory of timed automata
- A unified model for real-time systems: symbolic techniques and implementation
- Abstraction refinement algorithms for timed automata
- Better abstractions for timed automata
- Event clock automata: from theory to practice
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm
- Event-clock automata: a determinizable class of timed automata
- Fast algorithms for handling diagonal constraints in timed automata
- Fast zone-based algorithms for reachability in pushdown timed automata
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Forward analysis of updatable timed automata
- scientific article; zbMATH DE number 1400049 (Why is no real title available?)
- Lectures on Concurrency and Petri Nets
- On regions and zones for event-clock automata
- Reachability in timed automata with diagonal constraints
- Simulations for event-clock automata
- Symbolic optimal reachability in weighted timed automata
- Uppaal in a nutshell
This page was built for publication: Simulations for event-clock automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6597952)