Event-clock automata: a determinizable class of timed automata
From MaRDI portal
Recommendations
- Event clock automata: from theory to practice
- A Logical Characterisation of Event Clock Automata
- scientific article; zbMATH DE number 1390065
- Event-clock nested automata
- On the determinization of event-clock input-driven pushdown automata
- Event-Clock Visibly Pushdown Automata
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Distributed event clock automata (extended abstract)
- scientific article; zbMATH DE number 7559498
- scientific article; zbMATH DE number 1400049
Cites work
- A theory of timed automata
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 1256652 (Why is no real title available?)
- Model-checking in dense real-time
- Symbolic model checking for real-time systems
- Temporal proof methodologies for timed transition systems
- The benefits of relaxing punctuality
- The complementation problem for Büchi automata with applications to temporal logic
- Timing verification by successive approximation
- Using mappings to prove timing properties
Cited in
(67)- Enzymatic competition: Modeling and verification with timed hybrid Petri nets
- Event-clock nested automata
- The language preservation problem is undecidable for parametric event-recording automata
- Weighted register automata and weighted logic on data words
- A logical characterization of data languages.
- Updatable timed automata
- Modal event-clock specifications for timed component-based design
- Active learning of timed automata with unobservable resets
- A game approach to determinize timed automata
- Complexity issues for timeline-based planning over dense time under future and minimal semantics
- On the determinization of event-clock input-driven pushdown automata
- Context-free timed formalisms: robust automata and linear temporal logics
- SMT-based satisfiability of first-order LTL with event freezing functions and metric operators
- Reachability relations of timed pushdown automata
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm
- Checking conformance for time-constrained scenario-based specifications
- Monotonic hybrid systems
- scientific article; zbMATH DE number 1696511 (Why is no real title available?)
- A perfect class of context-sensitive timed languages
- Interval duration logic: expressiveness and decidability
- Timed CSP = closed timed automata
- Predictability of event occurrences in timed systems
- Methodologies for specification of real-time systems using timed I/O automata
- Event clock automata: from theory to practice
- Model Checking Real-Time Systems
- Weighted register automata and weighted logic on data words
- Time-Bounded Verification
- Linear-time temporal logic with event freezing functions
- Timed context-free temporal logics
- Timed Automata with Integer Resets: Language Inclusion and Expressiveness
- Memory event clocks
- Event-Clock Visibly Pushdown Automata
- Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
- Weighted Timed MSO Logics
- Realizability of real-time logics
- A survey of timed automata for the development of real-time systems
- On regions and zones for event-clock automata
- scientific article; zbMATH DE number 1390065 (Why is no real title available?)
- Learning one-clock timed automata
- scientific article; zbMATH DE number 7559498 (Why is no real title available?)
- Determinisability of register and timed automata
- Formal language properties of hybrid systems with strong resets
- Distributed event clock automata (extended abstract)
- Model checking weighted integer reset timed automata
- Automata and Logics for Timed Message Sequence Charts
- The efficiency of identifying timed automata and the power of clocks
- A Logical Characterisation of Event Clock Automata
- Compositional design of stochastic timed automata
- Inference of Event-Recording Automata Using Timed Decision Trees
- Timed bounded verification of inclusion based on timed bounded discretized language
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Learning of event-recording automata
- Equivalence checking and intersection of deterministic timed finite state machines
- Inferring Symbolic Automata
- Active learning of one-clock timed automata using constraint solving
- Learning assumptions for compositional verification of timed automata
- A unified model for real-time systems: symbolic techniques and implementation
- Repairing timed automata clock guards through abstraction and testing
- Simulations for event-clock automata
- History-deterministic timed automata
- MITL model checking via generalized timed automata and a new liveness algorithm
- Model-checking real-time systems: revisiting the alternating automaton route
- Learning deterministic multi-clock timed automata
- The bright side of timed opacity
- \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability
- Conformance testing for real-time systems
This page was built for publication: Event-clock automata: a determinizable class of timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274452)
