Parametric real-time reasoning
From MaRDI portal
Cited in
(86)- On minimal elements of upward-closed sets
- Decision problems for lower/upper bound parametric timed automata
- What's decidable about hybrid automata?
- Generalized discrete timed automata: Decidable approximations for safety verification.
- On clock-aware LTL parameter synthesis of timed automata
- The language preservation problem is undecidable for parametric event-recording automata
- Linear parametric model checking of timed automata
- Updatable timed automata
- Iterative bounded synthesis for efficient cycle detection in parametric timed automata
- Zone-based verification of timed automata: extrapolations, simulations and what next?
- Efficient convex zone merging in parametric timed automata
- An algorithm for single-source shortest paths enumeration in parameterized weighted graphs
- On completeness of liveness synthesis for parametric timed automata (Extended Abstract)
- An extension of the inverse method to probabilistic timed automata
- Consistency in parametric interval probabilistic timed automata
- Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques
- Formal verification of multitasking applications based on timed automata model
- Parameter synthesis for probabilistic timed automata using stochastic game abstractions
- Formalized timed automata
- Discrete parameters in Petri nets
- Language preservation problems in parametric timed automata
- Parameterized weighted containment
- Model Checking Real-Time Systems
- Verification of Hybrid Systems
- Parametric Deadlock-Freeness Checking Timed Automata
- Reachability in Succinct and Parametric One-Counter Automata
- Parametric Timed Model Checking for Guaranteeing Timed Opacity
- Time Unbalanced Partial Order
- Parameter synthesis for probabilistic timed automata using stochastic game abstractions
- Language emptiness of continuous-time parametric timed automata
- Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph
- Shrinking of time Petri nets
- Robust synthesis for real-time systems
- A survey of timed automata for the development of real-time systems
- Low dimensional hybrid systems -- decidable, undecidable, don't know
- LTL parameter synthesis of parametric timed automata
- New decidability results concerning two-way counter machines and applications
- What's decidable about parametric timed automata?
- Robust reachability in timed automata and games: a game-based approach
- Parametric metric interval temporal logic
- Parameter synthesis for hierarchical concurrent real-time systems
- The complexity of flat freeze LTL
- An inverse method for parametric timed automata
- Parametric updates in parametric timed automata
- Parametric schedulability analysis of a launcher flight control system under reactivity constraints
- Parametric analyses of attack-fault trees
- Cost problems for parametric time Petri nets
- Efficient scaling-invariant checking of timed bisimulation
- Reachability and liveness in parametric timed automata
- Coverability synthesis in parametric Petri nets
- The complexity of flat freeze LTL
- On parametric timed automata and one-counter machines
- Specification Theories for Probabilistic and Real-Time Systems
- A menagerie of timed automata
- Language preservation problems in parametric timed automata
- A game approach to the parametric control of real-time systems
- Parametric verification of weighted systems
- Continuous One-counter Automata
- A real-time interval logic and its decision procedure
- Quantitative analysis of interval Markov chains
- Distributed parametric model checking timed automata under non-zenoness assumption
- Parameter Synthesis for Bounded Cost Reachability in Time Petri Nets
- Parametric updates in parametric timed automata
- Coefficient synthesis for threshold automata
- Pattern Matching and Parameter Identification for Parametric Timed Regular Expressions
- A probabilistic logic for verifying continuous-time Markov chains
- Repairing timed automata clock guards through abstraction and testing
- Mean-payoff optimization in continuous-time Markov chains with parametric alarms
- Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete
- A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets
- Cycle encoding-based parameter synthesis for timed automata safety
- On the complexity of decision problems for parameterized finite state synchronous transducers
- Interval logics and their decision procedures. II: A real-time interval logic
- A new approach for showing termination of parameterized transition systems
- Parikh one-counter automata
- Reachability solution characterization of parametric real-time systems
- Reachability in two-parametric timed automata with one parameter is expspace-complete
- Dense integer-complete synthesis for bounded parametric timed automata
- Execution-time opacity problems in one-clock parametric timed automata
- The bright side of timed opacity
- Time-budgeting: a component based development methodology for real-time embedded systems
- Stubborn set reduction for timed reachability and safety games
- Tweaking the odds in probabilistic timed automata
- \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability
- Robust parametric reachability for timed automata
- Parametric probabilistic transition systems for system design and analysis
This page was built for publication: Parametric real-time reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248530)
