Improving the construction of the DBM over-approximation of the state space of real-time preemptive systems

DOI10.14232/ACTACYB.20.3.2012.1MaRDI QIDQ4898735zbMATH OpenOpenAlexFDO

Authors Abdelli Abdelkrim

Publication date 2 January 2013

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14232/actacyb.20.3.2012.1

zbMATH Keywords

time Petri netspreemptive systemsstate class graphDBM over-approximationstopwatch inhibitor arcs

Mathematics Subject Classification ID

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

Recommendations

• Hypervolume Approximation in Timed Automata Model Checking
• A quadratic-time DBM-based successor algorithm for checking timed automata
• State space computation and analysis of Time Petri Nets
• Model Checking Timed Automata with Priorities Using DBM Subtraction
• Applications and Theory of Petri Nets 2004

Cited in

(1)

• Time distance-based computation of the \textit{DBM} over-approximation of preemptive real-time systems

This page was built for publication: Improving the construction of the DBM over-approximation of the state space of real-time preemptive systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4898735)