Shrinking timed automata

DOI10.4230/LIPICS.FSTTCS.2011.90zbMATH Open1246.68159OpenAlexW2242084152MaRDI QIDQ2911615FDOQ2911615

Authors: Ocan Sankur, Patricia Bouyer, Nicolas Markey 

Publication date: 31 August 2012

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.90

Recommendations

• Shrinking timed automata
• Shrinking of time Petri nets
• SHRINKING RESTARTING AUTOMATA
• Mathematical Foundations of Computer Science 2005
• Fundamentals of Computation Theory
• scientific article; zbMATH DE number 2102690
• scientific article; zbMATH DE number 6300098
• scientific article; zbMATH DE number 1507209
• Timed automata

zbMATH Keywords

robustnesstimed automataimplementability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (7)

• Formal Modeling and Analysis of Timed Systems
• Robust model-checking of timed automata via pumping in channel machines
• Language preservation problems in parametric timed automata
• Shrinking timed automata
• Robust reachability in timed automata and games: a game-based approach
• Robust synthesis for real-time systems
• Title not available (Why is that?)

This page was built for publication: Shrinking timed automata

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