An Introduction to History Dependent Automata

Automata (or labeled transition systems) are widely used as operational models in the field 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 infinite automata are obtained in this case also for very simple agents and a non-standard definition 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 of ?-calculus and of other history dependent formalisms. We also define a bisimulation equivalence on history dependent automata, that captures ?-calculus bisimulation. The results presented here are discussed in more detail in 21].

[1]  Mads Dam.  On the Decidability of Process Equivalences for the pi-Calculus , 1997, Theor. Comput. Sci..

[2]  David Walker,et al.  Objects in the pi-Calculus , 1992, Inf. Comput..

[3]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[4]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994 .

[5]  Matthew Hennessy,et al.  Observing Localities , 1993, Theor. Comput. Sci..

[6]  Ugo Montanari,et al.  History-Dependent Automata , 1998 .

[7]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[8]  Stefania Gnesi,et al.  The Integration Project for the JACK Environement , 1994 .

[9]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[10]  Marco Pistore,et al.  An Automated Based Verification Environment for Mobile Processes , 1997, TACAS.

[11]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[12]  Marco Pistore,et al.  History dependent verification for partial order systems , 1997, Partial Order Methods in Verification.

[13]  Rocco De Nicola,et al.  CCS is an (Augmented) Contact Free C/E System , 1986, Mathematical Models for the Semantics of Parallelism.

[14]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, Theor. Comput. Sci..

[15]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[16]  Marco Pistore,et al.  Minimal Transition Systems for History-Preserving Bisimulation , 1997, STACS.

[17]  Marco Pistore,et al.  Checking Bisimilarity for Finitary pi-Calculus , 1995, CONCUR.

[18]  Paola Inverardi,et al.  Evaluation of Tools for the Analysis of Communicating Systems , 1991, Bull. EATCS.

[19]  Philippe Darondeau,et al.  Causal Trees , 1989, ICALP.

[20]  Marco Pistore,et al.  Efficient Minimization up to Location Equivalence , 1996, ESOP.

[21]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..