A Proof-Based Ground Algebraic Meta-Model for Reasoning on ASTD in Event-B

Algebraic State Transition Diagram (ASTD) is a formal, graphical, state-based modeling language for the design of complex critical systems. It offers a set of process algebra operators to compose hierarchical state machines, streamlining modularity in system design. Despite advances in incorporating features such as local state variables and real time, ASTD tool support has primarily focused on design and testing. Recently, proof obligations for state invariant preservation were introduced, but the validity of these proof obligations was informally justified. To address this issue, this paper introduces an Event-B-based algebraic data-type, called EB[ASTD], formalising the operational semantics of ASTDs. Relying on a deep modelling strategy, this framework defines a ground model for the formal operational semantics of ASTDs and provides a proof-based mechanism allowing for reasoning on specific ASTDs defined as instances of this meta-model. It enables explicit manipulation of ASTD concepts and improves formal reasoning by integrating their syntax and semantics as Event- B algebraic theories. The designed tool relies on the Rodin platform to provide automated proof obligation generation, automatic and interactive verification, graphical animation, and model checking of ASTDs. In addition, it allows us to prove the validity of the generated ASTD proof obligations for state invariants, which reveals the core properties and theorems that ensure its reliability. Overall, EB[ASTD] provides a sound foundation for proving properties about ASTDs and operates effectively within the Rodin platform, designed for managing ASTD models and proofs.

Authors

Institutions

Publication Details

Published
2025-04-27
DOI
https://doi.org/10.1109/formalise66629.2025.00011
Citations
3
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
4.51
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Proof-Based Ground Algebraic Meta-Model for Reasoning on ASTD in Event-B

Guillaume Dupont, Marc Frappier, Neeraj Kumar Singh, C. F. CHEN‡ et al.
3 citations
Formal Methods in Verification
4.51
article

A Proof-Based Ground Algebraic Meta-Model for Reasoning on ASTD in Event-B

Guillaume Dupont, Marc Frappier, Neeraj Kumar Singh, C. F. CHEN‡, Peter Rivière, Yamine Aït Ameur
article en
3 citations

Abstract

Algebraic State Transition Diagram (ASTD) is a formal, graphical, state-based modeling language for the design of complex critical systems. It offers a set of process algebra operators to compose hierarchical state machines, streamlining modularity in system design. Despite advances in incorporating features such as local state variables and real time, ASTD tool support has primarily focused on design and testing. Recently, proof obligations for state invariant preservation were introduced, but the validity of these proof obligations was informally justified. To address this issue, this paper introduces an Event-B-based algebraic data-type, called EB[ASTD], formalising the operational semantics of ASTDs. Relying on a deep modelling strategy, this framework defines a ground model for the formal operational semantics of ASTDs and provides a proof-based mechanism allowing for reasoning on specific ASTDs defined as instances of this meta-model. It enables explicit manipulation of ASTD concepts and improves formal reasoning by integrating their syntax and semantics as Event- B algebraic theories. The designed tool relies on the Rodin platform to provide automated proof obligation generation, automatic and interactive verification, graphical animation, and model checking of ASTDs. In addition, it allows us to prove the validity of the generated ASTD proof obligations for state invariants, which reveals the core properties and theorems that ensure its reliability. Overall, EB[ASTD] provides a sound foundation for proving properties about ASTDs and operates effectively within the Rodin platform, designed for managing ASTD models and proofs.

Centre National de la Recherche Scientifique (FR), Université Toulouse III - Paul Sabatier (FR), Université de Sherbrooke (CA), Institut National Polytechnique de Toulouse (FR), Université Toulouse-I-Capitole (FR), Institut de Recherche en Informatique de Toulouse (FR), Université Toulouse - Jean Jaurès (FR), Institut Polytechnique de Bordeaux (FR), École Nationale Supérieure d'Électrotechnique, d'Électronique, d'Informatique, d'Hydraulique et des Télécommunications (FR)
Openalex Percentile: Top 5%
Formal Methods in Verification
4.51
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.