scientific article; zbMATH DE number 7649924

DOI10.4230/LIPIcs.CONCUR.2019.16MaRDI QIDQ5875377

No author found.

Publication date: 3 February 2023

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

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

zbMATH Keywords

verificationtimed automataabstractionlocal-time semantics

Mathematics Subject Classification ID

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

Related Items (4)

Spotlight abstraction in model checking real-time task schedulability ⋮ Reachability relations of timed pushdown automata ⋮ Unnamed Item ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next?

Uses Software

• Uppaal
• GitHub

Cites Work

• Unnamed Item
• A theory of timed automata
• Uppaal in a nutshell
• Abstract interpretation with unfoldings
• A partial order semantics approach to the clock explosion problem of timed automata
• Better Abstractions for Timed Automata
• Tools and Algorithms for the Construction and Analysis of Systems
• Lectures on Concurrency and Petri Nets
• On Interleaving in Timed Automata
• Start pruning when time gets urgent: partial order reduction for timed systems

This page was built for publication: