The following pages link to PPL (Q17497):
Displaying 50 items.
- Efficient constraint/generator removal from double description of polyhedra (Q281283) (← links)
- Quantitative verification and strategy synthesis for stochastic games (Q328165) (← links)
- Shrinking of time Petri nets (Q378906) (← links)
- Robust synthesis for real-time systems (Q386617) (← links)
- Automatic synthesis of switching controllers for linear hybrid systems: safety control (Q391117) (← links)
- Discovering invariants via simple component analysis (Q435979) (← links)
- Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets (Q442295) (← links)
- Reachability analysis for timed automata using max-plus algebra (Q444476) (← links)
- Parameter synthesis for hierarchical concurrent real-time systems (Q488231) (← links)
- Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata (Q517046) (← links)
- Continuous valuations of temporal logic specifications with applications to parameter optimization and robustness measures (Q548479) (← links)
- Magic-sets for localised analysis of Java bytecode (Q656846) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- Horn clause verification with convex polyhedral abstraction and tree automata-based refinement (Q681335) (← links)
- A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
- Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems (Q748756) (← links)
- Cost analysis of object-oriented bytecode programs (Q764297) (← links)
- An integer static analysis for better extrapolation in Uppaal (Q832038) (← links)
- \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability (Q832203) (← links)
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness (Q845242) (← links)
- Some ways to reduce the space dimension in polyhedra computations (Q853727) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence (Q1620957) (← links)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
- On clock-aware LTL parameter synthesis of timed automata (Q1648651) (← links)
- Tracking smooth trajectories in linear hybrid systems (Q1680510) (← links)
- Realizability and inscribability for simplicial polytopes via nonlinear optimization (Q1683692) (← links)
- New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem (Q1688454) (← links)
- Checking array bounds by abstract interpretation and symbolic expressions (Q1799137) (← links)
- Algorithms for tight spans and tropical linear spaces (Q1994124) (← links)
- A dynamic F4 algorithm to compute Gröbner bases (Q2025446) (← links)
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro} (Q2105429) (← links)
- Efficient convex zone merging in parametric timed automata (Q2112120) (← links)
- Experimental evaluation of numerical domains for inferring ranges (Q2130561) (← links)
- On the efficiency of convex polyhedra (Q2130564) (← links)
- Relational string abstract domains (Q2152641) (← links)
- Abstraction based verification of stability of polyhedral switched systems (Q2178203) (← links)
- Refinements of behavioural abstractions for the supervisory control of hybrid systems (Q2197592) (← links)
- Even convexity and optimization. Handling strict inequalities (Q2215593) (← links)
- PPLite: zero-overhead encoding of NNC polyhedra (Q2216124) (← links)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- Template polyhedra and bilinear optimization (Q2322312) (← links)
- Two variations of graph test in double description method (Q2322740) (← links)
- Solving strong controllability of temporal problems with uncertainty using SMT (Q2342602) (← links)
- Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques (Q2343139) (← links)
- Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← links)
- On finite linear systems containing strict inequalities (Q2401512) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- STL*: extending signal temporal logic with signal-value freezing operator (Q2453214) (← links)
- Parameter synthesis for probabilistic timed automata using stochastic game abstractions (Q2636513) (← links)
