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 CCS with localities and the history-preserving semantics of Petri nets. Ordinary automata are an unsatisfactory operational model for these formalisms: innite automata are obtained for all the systems with innite computations, even for very simple ones; moreover, the ordinary denition of bisimulation does not apply in these cases, thus preventing the reusage of standard theories and algorithms. In this paper we show that HD-automata are an adequate model for the history-dependent formalisms. We present translations of -calculus, CCS with localities and Petri nets into HD-automata; and we show that nite HD-automata are obtained for signicant classes of systems with innite computations. We also dene HD-bisimulation, both in a set-theoretical way (that is suitable for automatic verication in
|
2762
|
Communication and Concurrency
– Milner
- 1989
|
|
316
|
The polyadic -calculus: a tutorial
– Milner
- 1991
|
|
229
|
Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms
– Sangiorgi
- 1992
|
|
172
|
A calculus of mobile processes (parts
– Milner, Parrow, et al.
- 1992
|
|
107
|
Bisimulation from open maps
– Joyal, Nielsen, et al.
- 1996
|
|
91
|
Modal logics for mobile processes
– Milner, Parrow, et al.
- 1993
|
|
86
|
The non-sequential behaviour of Petri nets
– Goltz, Reisig
- 1983
|
|
65
|
Causal trees
– Darondeau, Degano
- 1989
|
|
49
|
A theory of bisimulation for the -calculus
– Sangiorgi
- 1996
|
|
35
|
Observing localities
– Boudol, Castellani, et al.
- 1993
|
|
32
|
The integration project for the JACK environment
– Bouali, Gnesi, et al.
- 1994
|
|
31
|
The Chemical Abstract Machine, Theoretical Computer Science 96
– Berry, Boudol
- 1992
|
|
27
|
Three partition re algorithms
– Paige, Tarjan
- 1987
|
|
24
|
Partial orderings descriptions and observations of nondeterministic concurrent processes
– Degano, Nicola, et al.
- 1989
|
|
18
|
Bisimulation and abstraction homomorphisms
– Castellani
- 1987
|
|
17
|
The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets
– Valk, Jantzen
- 1985
|
|
11
|
Correspondence theory
– Bentham
- 1984
|
|
11
|
On the decidability of process equivalences for the -calculus
– Dam
- 1994
|
|
10
|
Evaluation of Tools for the Analysis of Communicating Systems
– Inverardi, Priami
- 1991
|
|
9
|
Observing distribution in processes
– Castellani
- 1993
|
|
8
|
CCS expressions, state processes, and three problems of equivalence
– Kanellakis, Smolka
- 1990
|
|
7
|
Structured transition systems with parametric observations: observational congruences and minimal realizations
– Ferrari, Montanari, et al.
- 1997
|
|
5
|
Distribution and locality of concurrent systems
– Corradini, Nicola
- 1994
|
|
5
|
Efficient minimization up to location equivalence
– Montanari, Pistore, et al.
- 1996
|
|
5
|
Canonical Representatives for Observational Equivalences Classes
– Montanari, Sgamma
- 1989
|
|
4
|
Checking bisimilarity for -calculus
– Montanari, Pistore
- 1995
|
|
3
|
An automata based veri environment for mobile processes
– Ferrari, Ferro, et al.
- 1997
|
|
2
|
Towards the uni of models of concurrency
– Ferrari, Montanari
- 1990
|
|
2
|
A -calculus with explicit substitutions. Theoret
– Ferrari, Montanari, et al.
- 1996
|
|
2
|
A theory of communicating processes
– Hoare, Brookes, et al.
- 1984
|
|
2
|
Verification tools for the CONCUR project
– Madelaine
- 1992
|
|
2
|
History dependent veri for partial order systems
– Montanari, Pistore
- 1997
|
|
2
|
Behaviour structure and nets, Fundamenta Informaticae 11(4
– RABINOVICH, TRAKHTENBROT
- 1988
|
|
1
|
A static view of localities. Formal Aspects of Computing
– Aceto
- 1994
|
|
1
|
Comparing locality and causality based equivalences Acta Informatica
– Kiehn
- 1994
|
|
1
|
A partition re algorithm for the -calculus
– Pistore, Sangiorgi
- 1996
|
|
1
|
Sangiorgi Locality and interleaving semantics in calculi for mobile processes
– unknown authors
- 1996
|
|
