Three partition refinement algorithms
SIAM Journal on Computing
A calculus of mobile processes, II
Information and Computation
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
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
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Resource Based Models for Asynchrony
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A Partition Refinement Algorithm for the pi-Calculus (Extended Abstract)
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Ugo Montanari and Software Verification
Concurrency, Graphs and Models
Minimization Algorithm for Symbolic Bisimilarity
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Science of Computer Programming
Basic observables for a calculus for global computing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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
| Hi-index | 0.00 |
The π-calculus is a development of CCS that has the ability of communicating channel names. The asynchronous π-calculus is a variant of the π-calculus where message emission is non-blocking. Finite state verification is problematic in this context, since even very simple asynchronous π-processes give rise to infinite-state behaviors. This is due to phenomena that are typical of calculi with name passing and to phenomena that are peculiar of asynchronous calculi. We present a finite-state characterization of a family of finitary asynchronous π-processes by exploiting History Dependent transition systems with Negative transitions (HDN), an extension of labelled transition systems particularly suited for dealing with concurrent calculi with name passing. We also propose an algorithm based on HDN to verify asynchronous bisimulation for finitary π-processes.