scholarly journals Lazy Abstraction-Based Controller Synthesis

2019 ◽  
pp. 23-47
Author(s):  
Kyle Hsu ◽  
Rupak Majumdar ◽  
Kaushik Mallik ◽  
Anne-Kathrin Schmuck
Keyword(s):  
Controller Synthesis ◽  
Lazy Abstraction

PID CONTROLLER SYNTHESIS FREE OF ANALYTICAL MODELS

2005 ◽  
Vol 38 (1) ◽  
pp. 367-372 ◽  
Author(s):  
L.H. Keel ◽  
S.P. Bhattacharyya
Keyword(s):  
Pid Controller ◽  
Controller Synthesis ◽  
Analytical Models

scholarly journals Divergent stutter bisimulation abstraction for controller synthesis with linear temporal logic specifications

Automatica ◽  
2021 ◽  
Vol 130 ◽  
pp. 109723
Author(s):  
Sahar Mohajerani ◽  
Robi Malik ◽  
Andrew Wintenberg ◽  
Stéphane Lafortune ◽  
Necmiye Ozay
Keyword(s):  
Temporal Logic ◽  
Linear Temporal Logic ◽  
Controller Synthesis

scholarly journals Configurable verification of timed automata with discrete variables

2020 ◽  
Author(s):  
Tamás Tóth ◽  
István Majzik
Keyword(s):  
Timed Automata ◽  
Empirical Evaluation ◽  
Real Time Systems ◽  
Discrete Variables ◽  
Reachability Problem ◽  
Abstraction Refinement ◽  
Dependent Behavior ◽  
Wide Range ◽  
Time Systems ◽  
Lazy Abstraction

AbstractAlgorithms and protocols with time dependent behavior are often specified formally using timed automata. For practical real-time systems, besides real-valued clock variables, these specifications typically contain discrete data variables with nontrivial data flow. In this paper, we propose a configurable lazy abstraction framework for the location reachability problem of timed automata that potentially contain discrete variables. Moreover, based on our previous work, we uniformly formalize in our framework several abstraction refinement strategies for both clock and discrete variables that can be freely combined, resulting in many distinct algorithm configurations. Besides the proposed refinement strategies, the configurability of the framework allows the integration of existing efficient lazy abstraction algorithms for clock variables based on $${\textit{LU}}$$ LU -bounds. We demonstrate the applicability of the framework and the proposed refinement strategies by an empirical evaluation on a wide range of timed automata models, including ones that contain discrete variables or diagonal constraints.

Sign in / Sign up

Export Citation Format

Share Document