Bounded Model Checking for Parametric Timed Automata
From MaRDI portal
Publication:2889614
DOI10.1007/978-3-642-29072-5_6zbMath1350.68183OpenAlexW11326594MaRDI QIDQ2889614
Wojciech Penczek, Michał Knapik
Publication date: 8 June 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29072-5_6
Formal languages and automata (68Q45) 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 (8)
Parameter synthesis for probabilistic timed automata using stochastic game abstractions ⋮ Distributed parametric model checking timed automata under non-zenoness assumption ⋮ Parameter synthesis for hierarchical concurrent real-time systems ⋮ What’s Decidable About Parametric Timed Automata? ⋮ Unnamed Item ⋮ Timed automata relaxation for reachability ⋮ Iterative bounded synthesis for efficient cycle detection in parametric timed automata ⋮ Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques
Uses Software
This page was built for publication: Bounded Model Checking for Parametric Timed Automata
