Parametric disjunctive timed networks
From MaRDI portal
Cites work
- A theory of timed automata
- Decidability of parameterized verification
- Execution-time opacity problems in one-clock parametric timed automata
- Flatness and Complexity of Immediate Observation Petri Nets
- scientific article; zbMATH DE number 794257 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Language emptiness of continuous-time parametric timed automata
- Language preservation problems in parametric timed automata
- Linear parametric model checking of timed automata
- Model checking of systems with many identical timed processes
- Model checking parameterized systems
- On the complexity of linear arithmetic with divisibility
- Parameterized Analysis of Immediate Observation Petri Nets
- Parameterized model checking of networks of timed automata with Boolean guards
- Parameterized verification of ad hoc networks
- Parameterized verification of time-sensitive models of ad hoc network protocols
- Parameterized verification of timed networks with clock invariants
- Parametric real-time reasoning
- Parametric timed broadcast protocols
- Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete
- Recoverability of Communication Protocols--Implications of a Theoretical Study
- Timed lossy channel systems
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Parametric disjunctive timed networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445686)