Parametric Disjunctive Timed Networks

2025/12/04 by Étienne André, André, Étienne, Swen Jacobs +3
Computer Science · #Distributed systems and fault tolerance #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Petri Nets in System Modeling

paper · pdf · doi:10.48550/arxiv.2512.04991

openalex publication_date 2025/12/04 · openalex created_date 2025/12/06 · openalex updated_date 2026/07/28

Abstract

No description supplied

Citations

• Execution-time opacity problems in one-clock parametric timed automata
• Parameterized Verification of Timed Networks with Clock Invariants
• Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete
• Parameterized Analysis of Immediate Observation Petri Nets
• Language Emptiness of Continuous-Time Parametric Timed Automata
• A theory of timed automata

Related

• Parameterized Verification of Timed Networks with Clock Invariants
• On the expressive power of invariants in parametric timed automata
• Liveness of Parameterized Timed Networks
• Decidability of Timed Communicating Automata
• Reachability of Communicating Timed Processes