Requirements Engineering via Non-monotonic Logics and State Diagrams

We propose to model the behaviour of embedded systems by finite state machines whose transitions are modelled by predicates of non-monotonic logics. We argue that this enables modelling the behaviour in close parallelism to the requirements. Such requirements engineering also results in direct and automatic translation to implementation, minimising software faults. We present our method and illustrated with a classical example. We also compare our approach with other state diagram methods, as well as Petri nets and Behavior Trees.