@inbook{MontanariPistore:SFM:2005,
    Abstract = {In this paper we give an overview of History Dependent Automata, an extension of ordinary automata that overcomes their limitations in dealing with named calculi. In a named calculus, the observations labelling the transitions of a system may contain names which represent features such as communication channels, node identifiers, or the locations of the system. An example of named calculus is $\pi$-calculus, which has the ability of sending channel names as messages and thus of dynamically reconfiguring process acquaintances and of modeling agents and code mobility. We show that History-Dependent Automata allow for a compact representation of $\pi$-calculus processes which is suitable both for theoretical investigations and for practical purposes such as verification.},
    Address = {Berlin, Heidelberg},
    Author = {Montanari, Ugo and Pistore, Marco},
    BookTitle = {Formal Methods for Mobile Computing: 5th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM-Moby 2005, Bertinoro, Italy, April 26-30, 2005, Advanced Lectures},
    Editor = {Bernardo, Marco and Bogliolo, Alessandro},
    File = {History-Dependent Automata - Montanari-Pistore2005\_Chapter\_History-DependentAutomataAnInt - a - v.pdf},
    ISBN = {978-3-540-32021-0},
    Pages = {1--28},
    Publisher = {Springer},
    Title = {History-Dependent Automata: An Introduction},
    URL = {https://doi.org/10.1007/11419822\_1},
    Year = {2005},
    bdsk-url-1 = {https://doi.org/10.1007/11419822\_1},
    date-added = {2020-09-20 17:45:34 +0200},
    date-modified = {2020-09-20 17:47:05 +0200},
    doi = {10.1007/11419822_1}
}

@inbook{MontanariPistore:SFM:2005, Abstract = {In this paper we give an overview of History Dependent Automata, an extension of ordinary automata that overcomes their limitations in dealing with named calculi. In a named calculus, the observations labelling the transitions of a system may contain names which represent features such as communication channels, node identifiers, or the locations of the system. An example of named calculus is $\pi$-calculus, which has the ability of sending channel names as messages and thus of dynamically reconfiguring process acquaintances and of modeling agents and code mobility. We show that History-Dependent Automata allow for a compact representation of $\pi$-calculus processes which is suitable both for theoretical investigations and for practical purposes such as verification.}, Address = {Berlin, Heidelberg}, Author = {Montanari, Ugo and Pistore, Marco}, BookTitle = {Formal Methods for Mobile Computing: 5th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM-Moby 2005, Bertinoro, Italy, April 26-30, 2005, Advanced Lectures}, Editor = {Bernardo, Marco and Bogliolo, Alessandro}, File = {History-Dependent Automata - Montanari-Pistore2005_Chapter_History-DependentAutomataAnInt - a - v.pdf}, ISBN = {978-3-540-32021-0}, Pages = {1--28}, Publisher = {Springer}, Title = {History-Dependent Automata: An Introduction}, URL = {https://doi.org/10.1007/11419822_1}, Year = {2005}, bdsk-url-1 = {https://doi.org/10.1007/11419822_1}, date-added = {2020-09-20 17:45:34 +0200}, date-modified = {2020-09-20 17:47:05 +0200}, doi = {10.1007/11419822_1} }