An Introduction to History Dependent Automata

Ugo Montanari, Marco Pistore
1998 Electronical Notes in Theoretical Computer Science  
Automata (or labeled transition systems) are widely used as operational models in the eld of process description languages like CCS 13]. There are however classes of formalisms that are not modelled adequately by the automata. This is the case, for instance, of the -calculus 15,14], an extension of CCS where channels can be used as values in the communications and new channels can be created dynamically. Due to the necessity to represent the creation of new channels, in nite automata are
more » ... d in this case also for very simple agents and a non-standard de nition of bisimulation is required. In this paper we present an enhanced version of automata, called history dependent automata, that are adequate to represent the operational semantics ofcalculus and of other history dependent formalisms. We also de ne a bisimulation equivalence on history dependent automata, that captures -calculus bisimulation. The results presented here are discussed in more detail in 21].
doi:10.1016/s1571-0661(05)80696-6 fatcat:lvy6ubdmozcsrdt3jlkeznljj4