(Enter summary)
Abstract: In this paper we present history-dependent automata (HD-automata in brief). They are an extension of ordinary
automata that overcomes their limitations in dealing with history-dependent formalisms. In a history-dependent formalism
the actions that a system can perform carry information generated in the past history of the system. The most
interesting example is -calculus: channel names can be created by some actions and they can then be referenced by
successive actions. Other examples are... (Update)
Context of citations to this paper: More
...important aspect of all these formalisms is whether they can serve as a base for tools and for verification of properties. In [Montanari and Pistore 1997] the calculus is modeled in terms of historydependent automata (with local names in the transitions) that may lead to...
Cited by: More
Who is Pointing When to Whom: On Model-Checking Pointer.. - Distefano, Rensink.. (2003)
(Correct)
A Survey of Theories for Mobile Agents - Serugendo, Muhugusa, al. (1995)
(Correct)
Similar documents (at the sentence level):
12.4%: History-Dependent Automata - Montanari, Pistore (1998)
(Correct)
Active bibliography (related documents): More All
0.7: Towards a Semantic-Based Verification Environment for the .. - Ferrari, Modoni, Quaglia (1995)
(Correct)
0.6: Structured Coalbegras and Minimal Hd Automata for the.. - Montanari, Pistore (2000)
(Correct)
0.6: Universita degli Studi di Pisa - Facolta Di Scienze
(Correct)
Similar documents based on text:
0.4: Design Verification of a Safety-Critical Embedded Verifier - Bertoli, Traverso (2000)
(Correct)
Related documents from co-citation: More All
2: Information and Computation (context) - Milner, Parrow et al. - 1992
2: Solving shape-analysis problems in languages with destructive updating
- Sagiv, Reps et al. - 1996
2: Storeless semantics and alias logic (context) - Bozga, Iosif et al. - 2003
BibTeX entry: (Update)
Montanari, U. and M. Pistore (1997), "History-Dependent Automata," Technical report, Dipartimento di Informatica, Universita di Pisa, Italy, draft available from ftp://ftp.di.unipi.it/pub/Papers/pistore/ HDautomata. ps.gz. http://citeseer.ist.psu.edu/montanari01history.html More
@techreport{ montanari98historydependent,
author = "Ugo Montanari and Marco Pistore",
title = "History-Dependent Automata",
number = "TR-98-11",
month = "5,",
year = "1998",
url = "citeseer.ist.psu.edu/montanari01history.html" }
Citations (may not include all citations):
1933
Communication and Concurrency (context) - Milner - 1989
854
Information and Computation (context) - Milner, Parrow et al. - 1992
502
Concurrency and Automata on Infinite Sequences (context) - Park - 1980
404
A calculus for cryptographic protocols: the spi calculus
- Abadi, Gordon - 1999
344
Concurrent Constraint Programming (context) - Saraswat - 1993
291
A calculus of mobile agents
- Fournet, Gonthier et al. - 1996
254
Theoretical Computer Science (context) - Berry, Boudol et al. - 1992
254
Theoretical Computer Science (context) - Boudol, Castellani et al. - 1993
248
Expressing Mobility (context) - Sangiorgi - 1993
216
Theoretical Computer Science (context) - Milner, Parrow et al. - 1993
201
Three partition refinement algorithms (context) - Paige, Tarjan - 1987
186
Universal coalgebra: a theory of systems
- Rutten - 2000
182
Structured operational semantics and bisimulation as a congr.. (context) - Groote, Vaandrager - 1992
149
calculus: a tutorial (context) - Milner - 1993
136
Information and Computation (context) - Kanellakis, Smolka et al. - 1990
127
Information and Computation (context) - Walker, the - 1995
121
Bisimulation can't be traced (context) - Bloom, Istrail et al. - 1995
109
Theoretical Computer Science (context) - Hennessy, Lin - 1995
70
On asynchronous communication semantics
- Honda, Tokoro - 1991
69
Causal trees (context) - Darondeau, Degano - 1989
69
Information and Computation (context) - Joyal, Nielsen et al. - 1996
61
The Fusion Calculus: Expressiveness and Symmetry in Mobile P..
- Victor - 1998
59
The non-sequential behaviour of Petri nets (context) - Goltz, Reisig - 1983
49
A theory of bisimulation for -calculus (context) - Sangiorgi - 1996
49
Theoretical Computer Science (context) - Degano, De Nicola et al. - 1990
42
Theoretical Computer Science (context) - Amadio, Castellani et al. - 1998
28
An algebraic verification of a mobile network
- Orava, Parrow - 1992
27
The integration project for the JACK environment (context) - Bouali, Gnesi et al. - 1994
25
A congruence theorem for structured operational semantics of..
- Bernstein - 1998
22
Observing distribution (context) - Castellani - 1993
18
calculus with explicit substitutions (context) - Ferrari, Montanari et al. - 1996
17
Higher level synchronizing devices in MEIJE-SCCS (context) - De Simone - 1985
17
A fully-abstract model for the -calculus (context) - Fiore, Moggi et al. - 1996
17
Concurrent bisimulations in Petri nets (context) - Best, Devillers et al. - 1991
16
An introduction to history dependent automata (context) - Montanari, Pistore - 1998
16
Bisimulations for the join-calculus
- Boreale, Fournet et al. - 1998
15
Formal Aspects of Computing (context) - Aceto, view et al. - 1994
14
Minimal transition systems for history-preserving bisimulati.. (context) - Montanari, Pistore - 1997
12
The residue vector sets with applications to decidability pr.. (context) - Valk, Jantzen - 1985
12
Bisimulation and abstraction homomorphisms (context) - Castellani - 1987
12
A fully abstract semantics for causality in the -calculus (context) - Boreale, Sangiorgi - 1998
12
Behaviour structures and nets (context) - Rabinovich, Trakhtenbrot - 1988
12
Towards the unification of models for concurrency (context) - Ferrari, Montanari - 1990
11
FCTool set (context) - Ressouche, de Simone et al. - 1996
11
Comparing locality and causality based equivalences (context) - Kiehn - 1994
8
calculus to higher-order -calculus -- and back (context) - Sangiorgi - 1993
8
Dipartimento di Informatica (context) - Montanari, Pistore et al. - 1998
8
A fully abstract domain model for the pi-calculus (context) - Stark - 1996
8
structured coalgebras and minimal hd-automata (context) - Montanari, Pistore - 2000
7
Structured transition systems with parametric observations: .. (context) - Ferrari, Montanari et al. - 1997
7
Generalized OM-bisimulation (context) - Vogler - 1995
7
An automata based verification environment for mobile proces.. (context) - Ferrari, Ferro et al. - 1997
7
Presheaf models for the pi-calculus
- Cattani, Stark et al. - 1997
5
Canonical representatives for observational equivalence clas.. (context) - Montanari, Sgamma - 1989
5
Automatic verification of distributed systems: The process a.. (context) - Inverardi, Priami - 1996
5
Dipartimento di Informatica (context) - Pistore, Automata et al. - 1999
4
A partition refinement algorithm for the -calculus (context) - Pistore, Sangiorgi - 2001
4
Correspondence theory (context) - van Bentham - 1984
4
Locality and interleaving semantics in calculi for mobile pr.. (context) - Sangiorgi - 1996
3
Efficient minimization up to location equivalence (context) - Montanari, Pistore et al. - 1996
3
A model checking algorithm for -calculus agents (context) - Gnesi, Ristori - 1997
3
the decidability of process equivalences for the -calculus (context) - Dam - 1997
3
Checking bisimilarity for finitary -calculus (context) - Montanari, Pistore - 1995
3
Finite state verification for the asynchronous -calculus (context) - Montanari, Pistore - 1999
1
Distribution and locality of concurrent systems (context) - Corradinio, De Nicola - 1994
1
History dependent verification for partial order systems (context) - Montanari, Pistore - 1997
1
Technical Report TR (context) - Weber, Bloom et al. - 1996
1
The fusion calculus: Expressiveness abd symmetry in mobile p.. (context) - Parrow, Victor - 1998
1
A bisimulation method for cryptographic protocols in the spi.. (context) - Abadi, Gordon - 1998
1
Verification tools for the CONCUR project (context) - Madelaine - 1992
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