An assume/guarantee based compositional calculus for hybrid CSP

Authors:
Shuling Wang;Naijun Zhan;Dimitar Guelev
Affiliations:
State Key Lab. of Comput. Sci., Institute of Software, Chinese Academy of Sciences, China;State Key Lab. of Comput. Sci., Institute of Software, Chinese Academy of Sciences, China;Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Bulgaria
Venue:
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Year:
2012

Citing 17
Cited 0

Axiomatic semantics of communicating sequential processes

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
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
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

Hybrid Systems
Verifying Hybrid Systems

Hybrid Systems
Deductive Verification of Hybrid Systems Using STeP

HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Specifying Communicating Systems with Temporal Logic

Temporal Logic in Specification
A Duration Calculus with Infinite Intervals

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract)

Proceedings of the Carnegie Mellon Workshop on Logic of Programs
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
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)
P-A logic: a compositional proof system for distributed programs

Distributed Computing
On the completeness and decidability of duration calculus with iteration

Theoretical Computer Science
Proofs of Networks of Processes

IEEE Transactions on Software Engineering
Differential Dynamic Logic for Hybrid Systems

Journal of Automated Reasoning
A calculus for hybrid CSP

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Computing semi-algebraic invariants for polynomial dynamical systems

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hybrid CSP (HCSP) extends CSP to describe interacting continuous and discrete dynamics. The concurrency with synchronous communications, timing constructs, interrupts, differential equations, and so on, make the behavior of HCSP difficult to specify and verify. In this paper, we propose a Hoare style calculus for reasoning about HCSP. The calculus includes Duration Calculus formulas to record process execution history and reason about real-time properties and continuous evolution, and dedicated predicate symbols to specify communication traces and readiness of process actions so that the composite constructs of HCSP can be handled compositionally by using assume/guarantee reasoning.