Extended Algebraic State Transition Diagrams

by   LionelTidjon, et al.

Algebraic State-Transition Diagrams (ASTDs) are extensions of common automata and statecharts that can be combined with process algebra operators like sequence, choice, guard and quantified synchronization. They were previously introduced for the graphical representation, specification and proof of information systems. In an attempt to use ASTDs to specify cyber-attack detection, we have identified a number of missing features in ASTDs. This paper extends the ASTD notation with state variables (attributes), actions on transitions, and a new operator called flow which corresponds to AND states in statecharts and is a compromise between interleaving and synchronization in process algebras. We provide a formal structured operational semantics of these extensions and illustrate its implementation in an OCaml-based interpreter called iASTD and the model checker ProB. Extended ASTDs are illustrated in a case study in cyber attack detection.


page 1

page 2

page 3

page 4


Runtime Composition Of Systems of Interacting Cyber-Physical Components

We introduce a transition system based specification of cyber-physical s...

Reactive Bisimulation Semantics for a Process Algebra with Time-Outs

This paper introduces the counterpart of strong bisimilarity for labelle...

A String Diagrammatic Axiomatisation of Finite-State Automata

We develop a fully diagrammatic approach to the theory of finite-state a...

A Hybrid Dynamic Logic for Event/Data-based Systems

We propose E^↓-logic as a formal foundation for the specification and de...

MDA Models and PIM/PSM Transformations Using Extended Automata

This paper proposes a model of execution platform for the OMG request of...

Collaboration vs. choreography conformance in BPMN

The BPMN 2.0 standard is a widely used semi-formal notation to model fro...

On Uniformly Sampling Traces of a Transition System (Extended Version)

A key problem in constrained random verification (CRV) concerns generati...