ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
A survey of theories for mobile agents
World Wide Web
pi-Calculus, Structured Coalgebras, and Minimal HD-Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Bisimulation Equivalences for Graph Grammars
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Bisimulation equivalences for graph grammars
Formal and natural computing
Coalgebraic minimization of HD-automata for the π-calculus using polymorphic types
Theoretical Computer Science - Formal methods for components and objects
Structured coalgebras and minimal HD-automata for the π-calculus
Theoretical Computer Science - Mathematical foundations of computer science 2000
A general mathematics of names
Information and Computation
Checking Correctness of Transactional Behaviors
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
History Dependent Automata for Service Compatibility
Concurrency, Graphs and Models
Security-By-Contract for the Future Internet
Future Internet --- FIS 2008
Relationally Staged Computations in Calculi of Mobile Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Conceptional modeling and analysis of spatio-temporal processes in biomolecular systems
APCCM '09 Proceedings of the Sixth Asia-Pacific Conference on Conceptual Modeling - Volume 96
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
History-dependent automata: an introduction
SFM-Moby'05 Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing
Modelling fusion calculus using HD-Automata
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Model checking quantified computation tree logic
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Hi-index | 0.00 |
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 pi-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: infinite automata are obtained for all the systems with infinite computations, even for very simple ones; moreover, the ordinary definition 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 pi-calculus, CCS with localities and Petri nets into HD-automata; and we show that finite HD-automata are obtained for significant classes of systems with infinite computations. We also define HD-bisimulation, both in a set-theoretical way (that is suitable for automatic verification in the case of finite HD-automata) and in a categorical way (by exploiting open maps). HD-bisimulation captures the classical definitions of bisimulation on the considered history dependent formalisms.