Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
Information and Computation
On the decidability of process equivalences for the &pgr;-calculus
Theoretical Computer Science - Special issue on algebraic methodology and software technology
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Communication and Concurrency
pi-Calculus, Structured Coalgebras, and Minimal HD-Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
An Automated Based Verification Environment for Mobile Processes
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Finite State Verification for the Asynchronous pi-Calculus
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
From pi-Calculus to Higher-Order pi-Calculus - and Back
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
History-Dependent Automata
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
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A Chart Semantics for the Pi-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Explicit State Model Checking for Graph Grammars
Concurrency, Graphs and Models
Ugo Montanari and Concurrency Theory
Concurrency, Graphs and Models
Working with the Past: Integrating History in Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Modelling with history-dependent Petri nets
BPM'07 Proceedings of the 5th international conference on Business process management
Science of Computer Programming
Compositionality in graph transformation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Analysis of deadlocks in object groups
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
A petri net interpretation of open reconfigurable systems
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Model checking quantified computation tree logic
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A graphical representation for biological processes in the stochastic pi-calculus
Transactions on Computational Systems Biology VII
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Working with the Past: Integrating History in Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
Generalised compositionality in graph transformation
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
A Petri Net Interpretation of Open Reconfigurable Systems
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
| Hi-index | 0.00 |
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 π-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 π-calculus processes which is suitable both for theoretical investigations and for practical purposes such as verification.