Sciweavers

    TAMC
    2009
    Springer
    104views Applied Computing» more  TAMC 2009»
    Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
    14 years 7 months ago
    Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
    Download  wwwhome.cs.utwente.nl
    Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Tim...
    Jasper Berendsen, Taolue Chen, David N. Jansen
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.