Abstract
Labeled transition systems are key structures for modeling computation. In this paper, we
show how they lend themselves to ordinary logical analysis (without any special new formalisms),
by introducing their standard first-order theory. This perspective enables us to raise several basic
model-theoretic questions of definability, axiomatization and preservation for various notions of
process equivalence
... read more