Total order:
Lamport timestamps can be used to create a total ordering of events in a distributed system by using some arbitrary mechanism to break ties (e.g. the ID of the process).
Logical order:
When two entities communicate by message passing, then the send event is said to 'happen before' the receive event, and the logical order can be established among the events
Can anyone give me an example where I can see the differences of logical order and total order? What is the difference of both orders?
Since you are looking for an example about differences between Logical order and Total order, here is a little story my old distributed algorithm teacher told us when he wanted to explain that specific topic.
So what caused the problem here? It is the fact that B's branch's notion of real time is completely at odds with real time. The computer at B's local bank might have a clock that is drawing near with the respect to real time.It's either going faster than real time or it is going slower than the real time.
It so happens that A's, A's branch's time is is perfectly in sync with the real time, but that doesn't help A.
This example seems a little complex to understand straightaway. This is known as the clock synchronization problem.
I invite you strongly to read Lamport's paper concerning Time, Clocks, and the Ordering of Events in a Distributed System as he presents a different way to explain the differences.
You might also find these references quite handy :
I hope this helps.