I am studying different approaches for the definition of computation with continuous dynamical systems. I have been trying to find a nice introduction to the theory of "State transition systems" but failed to do so.

Does anybody know a modern introduction to the topic? Of particular interest would be something dealing with computability.


One of the key uses of state transition systems, also known as labelled transition systems, is for modelling concurrent systems.

One very nice, delightful even, book that uses labelled transition systems to give semantics to concurrent formalisms CCS and the $\pi$-calculus is Communicating and Mobile Systems: the Pi-Calculus by Robin Milner. Definitely worth reading.

Principles of Model Checking by Christel Baier and Joost-Pieter Katoen is about model checking concurrent systems, so early in the book labelled transition systems are introduced to give semantics to such systems. This book also talks about probabilistic labelled transitions too.

Another possibility is Concurrency: State Models & Java Programs by Jeff Magee & Jeff Kramer. This book takes a more practical approach, but comes with an analyzer for systems described using labelled transition systems.

I don't know much about continuous dynamic systems. Perhaps you want to look at hybrid systems?

  • $\begingroup$ Thank you very much Dave Clarke. Indeed I been studying hybrid systems for a while and they are, of course related. Nevertheless I am trying to find a framework where one can "define" computability for purely continuous systems, hybrid ones already have the discrete notion in them. There is a bunch of papers dealing with computability proofs in hybrid systems.This is one I found quite useful to get into the topic. $\endgroup$
    – JuanPi
    Apr 20 '12 at 10:03

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.