Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
The STATEMATE semantics of statecharts
ACM Transactions on Software Engineering and Methodology (TOSEM)
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
How to Combine Z with Process Algebra
ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
Using a Process Algebra to Control B Operations
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Defining and translating a "safe" subset of simulink/stateflow into lustre
Proceedings of the 4th ACM international conference on Embedded software
A denotational semantics for stateflow
Proceedings of the 5th ACM international conference on Embedded software
Verification of Control Systems using Circus
ICECCS '06 Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems
An operational semantics for Stateflow
International Journal on Software Tools for Technology Transfer (STTT)
ArcAngelC: a Refinement Tactic Language for Circus
Electronic Notes in Theoretical Computer Science (ENTCS)
ClawZ: cost-effective formal verification for control systems
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Control law diagrams in circus
FM'05 Proceedings of the 2005 international conference on Formal Methods
A semantics for UML-RT active classes via mapping into circus
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
| Hi-index | 0.00 |
The Matlab Simulink tool is widely used to construct and analyse control law diagrams. Many have worked on techniques to enhance analysis facilities, and previously, we have considered the complementary problem of proving correctness of implementations of diagrams. We use Circus, a refinement language that combines Z and CSP, and can capture both functional and behavioural aspects of diagrams and programs. We defined a Circus semantics for an extensive subset of discrete-time diagrams, and now extend it to cover Stateflow blocks, which are themselves defined by diagrams written in (a variant of) the statechart notation. We highlight the challenging features of the semantics of a diagram, describe how Circus models can be constructed, and discuss the formalisation of the Circus semantics as algebraic translation rules.