See this document in CiteSeerX!

Universita degli Studi di Pisa  (Make Corrections)  
Facolta di Scienze Matematiche, Fisiche e Naturali Corso di Laurea...



  Home/Search   Context   Related

 
View or download:
etd.adm.unipi.it/t...or_HDAutomata.pdf
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  etd.adm.unipi.it/theses/availa... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Contents 1 Introduction 5 2 Preliminaries 13 2.1 The #-calculus 13 2.1.1 Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 2.1.2 Early operational semantics . . . . . . . . . . . . . . . . . . . . . . . 15 2.1.3 Example: bu#ers and memory cells . . . . . . . . . . . . . . . . . . . 17 2.2 Names and Permutations 18 2.3 History-dependent automata with symmetries 19 2.4 From #-calculus agents to HD-automata 21 2.4.1 Example: translating buf and cell . . . . . . . . . ... (Update)

Active bibliography (related documents):   More   All
0.6:   History Dependent Automata - Montanari, Pistore (2001)   (Correct)
0.5:   Formal Verification of Cryptographic Protocols using.. - Gnesi, Latella, Lenzini   (Correct)
0.3:   Term Algebras with Length Function and Bounded Quantifier.. - Zhang, Sipma, Manna   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ scienze-universita,
  author = "Facolta Di Scienze",
  title = "Universita degli Studi di Pisa",
  url = "citeseer.ist.psu.edu/741424.html" }
Citations (may not include all citations):
1097   Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
404   A calculus for cryptographic protocols: The spi calculus - Abadi, Gordon - 1997
322   Breaking and fixing the Needham-Schroeder public-key protoco.. - Lowe - 1996
248   Expressing Mobility (context) - Sangiorgi - 1992
216   Theoretical Computer Science (context) - Milner, Parrow et al. - 1993
204   Lecture Notes in Computer Science (context) - Milner, of et al. - 1980
127   Information and Computation (context) - Walker, the - 1995
106   Lambda-calculus notation with nameless dummies (context) - de Bruijn - 1972
97   Mathematical Structures in Computer Science (context) - Milner, processes - 1992
53   theorem proving: a manifesto (context) - Halpern, Vardi et al. - 1991
49   Model checking mobile processes - Dam - 1993
43   The polyadic pi-calculus: a tutorial - Milner - 1993
18   calculus with explicit substitutions (context) - Ferrari, Montanari et al. - 1996
14   Minimal transition systems for historypreserving bisimulatio.. (context) - Montanari, Pistore - 1997
5   Dipartimento di Informatica (context) - Pistore, Automata et al. - 1999
3   cient unification algorithm (context) - Martelli, Montanari - 1982
3   A model checking algorithm for #-calculus agents (context) - Gnesi, Ristori - 1997
1   Springer-Verlag New York (context) - Reisig, an - 1985
1   in honour of Roger Needham (context) - Milner, name - 2003
1   ukreportEC LFC EC LFC (context) - Parrow, of et al. - 1992
1   Model-checking di proprieta causali di reti di petri (context) - Bartolini - 1999
1   A model checking verification environment for mobile process.. (context) - Ferrari, Gnesi et al. - 2004
http://fmt.isti.cnr.it:8080/
ftp://ftp.di.unipi
http://www.it.uu.se/research/
http://citeseer.ist.psu.edu/montanari00structured.html
http://www.it.uu.se/profundis/Year2/Deliv2/A.1.2.11

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC