Event-clock automata: a determinizable class of timed automata
From MaRDI portal
Publication:1274452
DOI10.1016/S0304-3975(97)00173-4zbMath0912.68132MaRDI QIDQ1274452
Thomas A. Henzinger, Limor Fix, Rajeev Alur
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (49)
Learning One-Clock Timed Automata ⋮ \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability ⋮ Updatable timed automata ⋮ Event Clock Automata: From Theory to Practice ⋮ Conformance testing for real-time systems ⋮ Model Checking Real-Time Systems ⋮ Weighted Register Automata and Weighted Logic on Data Words ⋮ Time-Bounded Verification ⋮ Learning of event-recording automata ⋮ SMT-based satisfiability of first-order LTL with event freezing functions and metric operators ⋮ A survey of timed automata for the development of real-time systems ⋮ Equivalence checking and intersection of deterministic timed finite state machines ⋮ Inferring Symbolic Automata ⋮ Active learning of one-clock timed automata using constraint solving ⋮ Modal event-clock specifications for timed component-based design ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reachability relations of timed pushdown automata ⋮ Timed Automata with Integer Resets: Language Inclusion and Expressiveness ⋮ On regions and zones for event-clock automata ⋮ The language preservation problem is undecidable for parametric event-recording automata ⋮ Event clock message passing automata: a logical characterization and an emptiness checking algorithm ⋮ Active learning of timed automata with unobservable resets ⋮ Model checking weighted integer reset timed automata ⋮ Compositional Design of Stochastic Timed Automata ⋮ Monotonic hybrid systems ⋮ The efficiency of identifying timed automata and the power of clocks ⋮ A game approach to determinize timed automata ⋮ Formal language properties of hybrid systems with strong resets ⋮ Event-Clock Visibly Pushdown Automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Weighted register automata and weighted logic on data words ⋮ Distributed Event Clock Automata ⋮ Methodologies for Specification of Real-Time Systems Using Timed I/O Automata ⋮ Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions ⋮ Automata and Logics for Timed Message Sequence Charts ⋮ Enzymatic competition: Modeling and verification with timed hybrid Petri nets ⋮ A Perfect Class of Context-Sensitive Timed Languages ⋮ Weighted Timed MSO Logics ⋮ Complexity issues for timeline-based planning over dense time under future and minimal semantics ⋮ Realizability of Real-Time Logics ⋮ Interval Duration Logic ⋮ Timed CSP = Closed Timed Automata1 ⋮ On the determinization of event-clock input-driven pushdown automata ⋮ A logical characterization of data languages. ⋮ Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language ⋮ Context-free timed formalisms: robust automata and linear temporal logics ⋮ Checking conformance for time-constrained scenario-based specifications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Model-checking in dense real-time
- The complementation problem for Büchi automata with applications to temporal logic
- Using mappings to prove timing properties
- A theory of timed automata
- Symbolic model checking for real-time systems
- Temporal proof methodologies for timed transition systems
- Timing verification by successive approximation
- The benefits of relaxing punctuality
This page was built for publication: Event-clock automata: a determinizable class of timed automata
