An Extension of π-Calculus with Real-Time and its Realization in Logic Programming

We extend π-calculus with real-time by adding clocks, and give an operational semantics for it. We introduce timed bisimilarity and develop its properties, in particular, expansion theorem for realtime, concurrent, mobile processes. We present the outline of an implementation based on co-induction, coroutining, and constraint logic programming over reals of this operational semantics. We show how timed π-calculus can be used for modeling and verification of complex real-time systems. We illustrate our work by applying it to modeling of practical problems such as the generalized railroad crossing problem.