An exercise in structural congruence
References (18)
- et al.
A spatial logic for concurrency (part I)
Inform. and Comput.
(2003) - et al.
Mobile ambients
Theoret. Comput. Sci.
(2000) A multiset semantics for the pi-calculus with replication
Theoret. Comput. Sci.
(1996)- et al.
Multisets and structural congruence of the pi-calculus with replication
Theoret. Comput. Sci.
(1999) - et al.
The complexity of the word problems for commutative semigroups and polynomial ideals
Adv. Math.
(1982) - et al.
On decidability of the control reachability problem in the asynchronous π-calculus
Nordic J. Comput.
(2002) - et al.
A Petri net semantics for π-calculus
Spatial congruence for ambients is decidable
- et al.
A new natural structural congruence in the pi-calculus with replication
Acta Inform.
(2004)
There are more references available in the full text version of this article.
Cited by (5)
Verifying mobile systems: Take two stateful observations of Pi-calculus processes
2019, Concurrent Systems Engineering SeriesStructural rewriting in the π-calculus
2014, OpenAccess Series in InformaticsAlgorithms for extended alpha-equivalence and complexity
2013, Leibniz International Proceedings in Informatics, LIPIcsA theory of structural stationarity in the π-Calculus
2009, Acta InformaticaChecking π-Calculus structural congruence is graph isomorphism complete
2009, Proceedings - International Conference on Application of Concurrency to System Design, ACSD
Copyright © 2006 Elsevier B.V. All rights reserved.