Distributed parametric model checking timed automata under non-zenoness assumption

DOI10.1007/s10703-022-00400-zzbMath1522.68294MaRDI QIDQ6108439

Étienne André, Laure Petrucci, Hoang Gia Nguyen, Jun Sun

Publication date: 29 June 2023

Published in: Formal Methods in System Design (Search for Journal in Brave)

zbMATH Keywords

distributed computingparametric timed automataparameter synthesisparametric model checkingZeno behaviors

Mathematics Subject Classification ID

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient emptiness check for timed Büchi automata
• Parameter synthesis for hierarchical concurrent real-time systems
• Checking timed Büchi automata emptiness efficiently
• How to stop time stopping
• The octahedron abstract domain
• Decision problems for lower/upper bound parametric timed automata
• A theory of timed automata
• Uppaal in a nutshell
• Linear parametric model checking of timed automata
• Iterative bounded synthesis for efficient cycle detection in parametric timed automata
• Compositional parameter synthesis
• Symbolic model checking for probabilistic timed automata
• Bounded Model Checking for Parametric Timed Automata
• Parametric Deadlock-Freeness Checking Timed Automata
• Language Emptiness of Continuous-Time Parametric Timed Automata
• Efficient Detection of Zeno Runs in Timed Automata
• AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
• Improved Multi-Core Nested Depth-First Search
• Learning-Based Compositional Parameter Synthesis for Event-Recording Automata
• Parametric real-time reasoning
• Lectures on Concurrency and Petri Nets

This page was built for publication: Distributed parametric model checking timed automata under non-zenoness assumption