A calculus for hybrid CSP

Authors:
Jiang Liu;Jidong Lv;Zhao Quan;Naijun Zhan;Hengjun Zhao;Chaochen Zhou;Liang Zou
Affiliations:
State Key Lab. of Computer Science, Institute of Software, CAS;State Key Lab. of Rail Traffic Control and Safety, Beijing Jiaotong University;State Key Lab. of Computer Science, Institute of Software, CAS;State Key Lab. of Computer Science, Institute of Software, CAS;State Key Lab. of Computer Science, Institute of Software, CAS;State Key Lab. of Computer Science, Institute of Software, CAS;State Key Lab. of Computer Science, Institute of Software, CAS
Venue:
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Year:
2010

Citing 12
Cited 4

From CSP to hybrid systems

A classical mind
A formal description of hybrid systems

Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Recent advances on determining the number of real roots of parametric polynomials

Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris)

Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris)
DISCOVERER: a tool for solving semi-algebraic systems

ACM Communications in Computer Algebra
Differential Dynamic Logic for Hybrid Systems

Journal of Automated Reasoning
Computing Differential Invariants of Hybrid Systems as Fixedpoints

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Constraint-Based Approach for Analysis of Hybrid Systems

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Real-Time Systems: Formal Specification and Automatic Verification

Real-Time Systems: Formal Specification and Automatic Verification
Verification of Sequential and Concurrent Programs

Verification of Sequential and Concurrent Programs
Differential-algebraic Dynamic Logic for Differential-algebraic Programs

Journal of Logic and Computation

Computing semi-algebraic invariants for polynomial dynamical systems

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
An assume/guarantee based compositional calculus for hybrid CSP

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Synthesizing switching controllers for hybrid systems by generating invariants

Theories of Programming and Formal Methods
Verifying simulink diagrams via a hybrid hoare logic prover

Proceedings of the Eleventh ACM International Conference on Embedded Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hybrid Communicating Sequential Processes (HCSP) is an extension of CSP allowing continuous dynamics. We are interested in applying HCSP to model and verify hybrid systems. This paper is to present a calculus for a subset of HCSP as a part of our efforts in modelling and verifying hybrid systems. The calculus consists of two parts. To deal with continuous dynamics, the calculus adopts differential invariants. A brief introduction to a complete algorithm for generating polynomial differential invariants is presented, which applies DISCOVERER, a symbolic computation tool for semi-algebraic systems. The other part of the calculus is a logic to reason about HCSP process, which involves communication, parallelism, real-time as well as continuous dynamics. This logic is named as Hybrid Hoare Logic. Its assertions consist of traditional pre- and post-conditions, and also Duration Calculus formulas to record execution history of HCSP process.