Results 1 -
5 of
5
Verification of hybrid systems: Formalization and proof rules in PVS
- in PVS. In: ICECCS, IEEE Computer Society
, 2001
"... Combining discrete state-machines with continuous behavior, hybrid systems are a well-established mathematical model for discrete systems acting in a continuous environment. As a priori infinite state systems, their computational properties are undecidable in the general model and the main line of r ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
Combining discrete state-machines with continuous behavior, hybrid systems are a well-established mathematical model for discrete systems acting in a continuous environment. As a priori infinite state systems, their computational properties are undecidable in the general model and the main line of research concentrates on model checking of finite abstractions of restricted subclasses of the general model. In our work, we use deductive methods, falling back upon the general-purpose theorem prover PVS. To do so we extend the classical approach for the verification of state-based programs by developing an inductive proof method to deal with the parallel composition of hybrid systems. It covers shared variable communication, labelsynchronization, and especially the common continuous activities in the parallel composition of hybrid automata. Besides hybrid systems and their parallel composition, we formalized their operational step semantics and a number of proof-rules within PVS, for one of which we give also a rigorous completeness proof. Moreover, the theory is applied to the verification of a number of examples.
Modeling and Verifying a Temperature Control System using Continuous Action Systems
- In Proc. of the 5th Int. Workshop in Formal Methods for Industrial Critical Systems
, 2000
"... . We describe and verify a real-time temperature control system for a nuclear ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
. We describe and verify a real-time temperature control system for a nuclear
Assertion-based analysis of hybrid systems with PVS
- In Proc. of EuroCAST'2001, LNCS
, 2001
"... Abstract. Hybrid systems are a well-established mathematical model for embedded systems. Such systems, which combine discrete and continuous behavior, are increasingly used in safety-critical applications. To guarantee safe functioning, formal verification techniques are crucial. While research in t ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. Hybrid systems are a well-established mathematical model for embedded systems. Such systems, which combine discrete and continuous behavior, are increasingly used in safety-critical applications. To guarantee safe functioning, formal verification techniques are crucial. While research in this area concentrates on model checking, deductive techniques attracted less attention. In this paper we use the general purpose theorem prover PVS for the rigorous formalization and analysis of hybrid systems. To allow for machine-assisted proofs, we implement a deductive assertional proof method within PVS. The sound and complete proof system allows modular proofs in that it comprises a proof rule for the parallel composition. Besides hybrid systems and the proof system, a number of examples are formalized within PVS.
Computational Issues in Intelligent Control: Discrete-Event and Hybrid Systems
- IN: SOFT COMPUTING AND INTELLIGENT SYSTEMS: THEORY AND PRACTICE
, 1999
"... Intelligent control methodologies are being developed to address the control needs of complex systems that exhibit complicated dynamical behaviors. The design, simulation, and verification of intelligent control systems is highly nontrivial and typically involves significant amount of computations. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Intelligent control methodologies are being developed to address the control needs of complex systems that exhibit complicated dynamical behaviors. The design, simulation, and verification of intelligent control systems is highly nontrivial and typically involves significant amount of computations. In this paper, we identify and discuss several computational issues that are central in intelligent control. In particular, we discuss how the design, simulation, and verification of discrete-event and hybrid systems, which are central in intelligent control, requires the development of computationally efficient algorithms and approaches. Petri net models are used to describe discrete event and hybrid systems. Computational issues of various problems and algorithms concerning the analysis and synthesis of such systems are discussed. In view of hybrid systems, we also review basic computational issues for hybrid automata. Finally, we present a parallel computing architecture for intelligent control systems and we illustrate its advantages by considering parallel discrete event simulations.
Graduate Supervisory Committee:
"... Cyber Physical Systems (CPSs) are systems comprising of computational systems that interact with the physical world to perform sensing, communication, computation and actuation. Common examples of these systems include Body Area Networks (BANs), Autonomous Vehicles (AVs), Power Distribution Systems ..."
Abstract
- Add to MetaCart
Cyber Physical Systems (CPSs) are systems comprising of computational systems that interact with the physical world to perform sensing, communication, computation and actuation. Common examples of these systems include Body Area Networks (BANs), Autonomous Vehicles (AVs), Power Distribution Systems etc. The close coupling between cyber and physical worlds in a CPS manifests in two types of interactions between computing systems and the physical world: intentional and unintentional. Unintentional interactions result from the physical characteristics of the computing systems and often cause harm to the physical world, if the computing nodes are close to each other, these interactions may overlap thereby increasing the chances of causing a Safety hazard. Similarly, due to mobile nature of computing nodes in a CPS planned and unplanned interactions with the physical world occur. These interactions represent the behavior of a computing node while it is following a planned path and during faulty operations. Both of these interactions change over time due to the dynamics (motion) of the computing node and may overlap thereby causing harm to the physical world. Lack of proper modeling and analysis frameworks for these systems causes system designers to use ad-hoc techniques thereby further increasing their design and development time. The thesis addresses these problems by taking a holistic approach to model Computational, Physical and Cyber Physical Interactions (CPIs) aspects of a CPS and proposes modeling constructs for them. These constructs are analyzed using a safety analysis algorithm developed as part of the thesis. The algorithm computes the intersection of CPIs for both mobile as well as static computing nodes and determines the safety of the physical system. A framework is developed by extending AADL to support these modeling constructs; the safety analysis algorithm is implemented as OSATE plug-in. The applicability of the proposed approach is demonstrated by considering the safety of human tissue during the operations of BAN, and the safety of passengers traveling in an

