Simulations for event-clock automata

DOI10.46298/LMCS-20(3:2)2024MaRDI QIDQ6597952

S. Akshay, Rakesh Govind, Paul Gastin, B. Srivathsan

Publication date: 4 September 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

verificationreachabilitysimulationsevent-clock automatazones

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On regions and zones for event-clock automata
• Fast zone-based algorithms for reachability in pushdown timed automata
• A quadratic-time DBM-based successor algorithm for checking timed automata
• Event-clock automata: a determinizable class of timed automata
• A theory of timed automata
• Uppaal in a nutshell
• Forward analysis of updatable timed automata
• Event clock message passing automata: a logical characterization and an emptiness checking algorithm
• Better Abstractions for Timed Automata
• Event Clock Automata: From Theory to Practice
• Symbolic Optimal Reachability in Weighted Timed Automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Lectures on Concurrency and Petri Nets
• Abstraction refinement algorithms for timed automata
• Fast algorithms for handling diagonal constraints in timed automata
• A unified model for real-time systems: symbolic techniques and implementation
• Simulations for event-clock automata

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)