Hi.

My name is Bennet Gedan and I’m an Electrical Systems Engineer, with passion for technology, programming, system engineering and the automotive industry. I play the piano.

Once a student of Electrical Engineering at Darmstadt University of Technolgy with major fields in Mechatronic Systems, Automation Technology and Control Theory, I’ve been a member of the core developers team of OSCAR, a lightweight EV prototype. I’ve worked with different employers and clients in the field of Battery Electric Systems, Driver Assistance Technologies and Automation Technology.

I’m currently living and working in Cologne, Germany as a Team Manager in the field of Advanced Driver Assistance Systems, Vehicle Dynamics and E-Mobility for one of Germany’s major Engineering Service Suppliers.

You can find out more about myself by browsing through my pages, visiting my Xing and LinkedIn profile or by viewing my CV.

This is my personal homepage, build with Hugo and ❤ Love under Fedora.

C-Frameworks: Basic State Machine Implementation. Pt. 2

How to Use Function Pointers for Implementing Finite State Machines

 Posted on September 30, 2018  |  6 minutes (1141 words)
I posted my solution for Finite State Machines in C using Matrix. Jean-Marc (f1hdi.org) commented to that entry: I would love to have the state event matrix not only returning a ‘next state’ and action to do BUT directly calling ‘actions’ functions. A long time ago , when I was at school, I wrote such ptr function call but can’t reproduce it now. Basically , in your routine below, I would love to replace the ‘return’ by a call to a function which you would have its pointer in the matrix. [Read More]
Programming  C  Coding  FSM  State Machines  Logic  Finte State Machines  Table Logic  Function Pointers  Pointers  References 

C-Frameworks: Basic State Machine Implementation

How to Use State Tables for Implementing Finite State Machines

 Posted on September 29, 2018  |  4 minutes (713 words)
There are several implementations of finite state machines avaible, the only drawback most of them are suffering is that they are moore machines (under certain circumstances this means a large number of states) and changing the machines behaviour will change the whole code structure (this means low flexibility and the reprogramming may be a huge cause of defects). I’d like to present an Implementation of a FSM, i’ve found during my student research project that is a mealy machine and does not require a reprogramming of the underlying structure. [Read More]
Programming  C  Coding  FSM  State Machines  Logic  Finte State Machines  Table Logic