scientific article; zbMATH DE number 7378572

DOI10.4230/LIPIcs.CONCUR.2018.28MaRDI QIDQ5009444

Paul Gastin, Sayan Mukherjee, B. Srivathsan

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1806.11007

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

reachabilitytimed automatazonesdiagonal constraints

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Configurable verification of timed automata with discrete variables ⋮ Reachability relations of timed pushdown automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next?

Uses Software

• Kronos
• z3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Better abstractions for timed automata
• A new polynomial-time algorithm for linear programming
• A quadratic-time DBM-based successor algorithm for checking timed automata
• A theory of timed automata
• Kronos: A verification tool for real-time systems
• Forward analysis of updatable timed automata
• Symbolic Optimal Reachability in Weighted Timed Automata
• Tools and Algorithms for the Construction and Analysis of Systems
• Lectures on Concurrency and Petri Nets
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: