scientific article; zbMATH DE number 1956585
From MaRDI portal
Publication:4417927
zbMath1031.68076MaRDI QIDQ4417927
Emmanuel Fleury, Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen
Publication date: 30 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2619/26190254.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (15)
Configurable verification of timed automata with discrete variables ⋮ Lazy Reachability Checking for Timed Automata with Discrete Variables ⋮ Verified Certification of Reachability Checking for Timed Automata ⋮ An integer static analysis for better extrapolation in Uppaal ⋮ Updatable timed automata ⋮ Model Checking Real-Time Systems ⋮ Better abstractions for timed automata ⋮ Untangling the graphs of timed automata to decrease the number of clocks ⋮ Accelerating worst case execution time analysis of timed automata models with cyclic behaviour ⋮ Finding minimum and maximum termination time of timed automata models with cyclic behaviour ⋮ Certifying emptiness of timed Büchi automata ⋮ Speeding Up Model Checking of Timed-Models by Combining Scenario Specialization and Live Component Analysis ⋮ Checking Timed Büchi Automata Emptiness Using LU-Abstractions ⋮ A partial order semantics approach to the clock explosion problem of timed automata ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next?
Uses Software
This page was built for publication:
