Ruslan Shevchenko – From Akka to Labelled Transition Systems – semi open questions


Can we say that Akka with new typing interface now ‘math-frienly’ ? We will show possible relation between Akka behaviour and well-studied math objects – Labelled Transition Systems (LTS). LTS can represent complex behaviors in composable and functional form. Other part of story – exists many techniques for operating with LTS specifications in a formal way, can we map this techniques to the Akka case ? And in general – how formal methods can be applicable in a day to day programming ?

Leave a Reply

Your email address will not be published. Required fields are marked *