-
1
-
-
0028464120
-
A term equality problem equivalent to graph isomorphism
-
D. Basin. A term equality problem equivalent to graph isomorphism. Inf. Proc. Letters, 51(2):61-66, 1994.
-
(1994)
Inf. Proc. Letters
, vol.51
, Issue.2
, pp. 61-66
-
-
Basin, D.1
-
2
-
-
74349084370
-
-
URL
-
The BLISS page. URL: http://www.tcs.hut.fi/Software/bliss/.
-
The BLISS Page
-
-
-
5
-
-
35048869191
-
Behavioural and spatial observations in a logic for the π-Calculus
-
volume 2987 of LNCS, Springer-Verlag
-
L. Caires. Behavioural and spatial observations in a logic for the π-Calculus. In Proc. FOSSACS'04, volume 2987 of LNCS, pages 72-89. Springer-Verlag, 2004.
-
(2004)
Proc. FOSSACS'04
, pp. 72-89
-
-
Caires, L.1
-
6
-
-
0004526320
-
Multisets and structural congruence of the π-Calculus with replication
-
J. Engelfriet and T. Gelsema. Multisets and structural congruence of the π-Calculus with replication. Theor. Comp. Sci., 211(1-2):311-337, 1999.
-
(1999)
Theor. Comp. Sci.
, vol.211
, Issue.1-2
, pp. 311-337
-
-
Engelfriet, J.1
Gelsema, T.2
-
7
-
-
67650349828
-
The decidability of structural congruence for replication restricted π-Calculus processes
-
Revised 2005
-
J. Engelfriet and T. Gelsema. The decidability of structural congruence for replication restricted π-Calculus processes. Technical report, Leiden Inst. of Adv. Comp. Sci., 2004. Revised 2005.
-
(2004)
Technical Report, Leiden Inst. of Adv. Comp. Sci.
-
-
Engelfriet, J.1
Gelsema, T.2
-
8
-
-
21144442838
-
A new natural structural congruence in the π-Calculus with replication
-
J. Engelfriet and T. Gelsema. A new natural structural congruence in the π-Calculus with replication. Acta Inf., 40(6):385-430, 2004.
-
(2004)
Acta Inf.
, vol.40
, Issue.6
, pp. 385-430
-
-
Engelfriet, J.1
Gelsema, T.2
-
9
-
-
33750340950
-
An exercise in structural congruence
-
J. Engelfriet and T. Gelsema. An exercise in structural congruence. Inf. Proc. Letters, 101(1):1-5, 2007.
-
(2007)
Inf. Proc. Letters
, vol.101
, Issue.1
, pp. 1-5
-
-
Engelfriet, J.1
Gelsema, T.2
-
10
-
-
2542474345
-
A model-checking verification environment for mobile processes
-
G.-L. Ferrari, S. Gnesi, U. Montanari, and M. Pistore. A model-checking verification environment for mobile processes. ACM Tran. on Soft. Eng. and Methodology, 12(4):440-473, 2003.
-
(2003)
ACM Tran. on Soft. Eng. and Methodology
, vol.12
, Issue.4
, pp. 440-473
-
-
Ferrari, G.-L.1
Gnesi, S.2
Montanari, U.3
Pistore, M.4
-
11
-
-
0344152292
-
Term graph rewriting for the π-Calculus
-
volume 2895 of LNCS, Springer
-
F. Gadducci. Term graph rewriting for the π-Calculus. In Proc. APLAS'03, volume 2895 of LNCS, pages 37-54. Springer, 2003.
-
(2003)
Proc. APLAS'03
, pp. 37-54
-
-
Gadducci, F.1
-
13
-
-
48249157081
-
Applying Petri net unfoldings for verification of mobile systems
-
V. Khomenko, M. Koutny, and A. Niaouris. Applying Petri net unfoldings for verification of mobile systems. In Proc. MOCA'06, pages 161-178, 2006.
-
(2006)
Proc. MOCA'06
, pp. 161-178
-
-
Khomenko, V.1
Koutny, M.2
Niaouris, A.3
-
16
-
-
67650407510
-
A theory of structural stationarity in the π-calculus
-
R. Meyer. A theory of structural stationarity in the π-calculus. Acta Informatica, 46(2):87-137, 2009.
-
(2009)
Acta Informatica
, vol.46
, Issue.2
, pp. 87-137
-
-
Meyer, R.1
-
17
-
-
48249095460
-
A practical approach to verification of mobile systems using net unfoldings
-
volume 5062 of LNCS, Springer-Verlag
-
R. Meyer, V. Khomenko, and T. Strazny. A practical approach to verification of mobile systems using net unfoldings. In Proc. ATPN'08, volume 5062 of LNCS, pages 327-347. Springer-Verlag, 2008.
-
(2008)
Proc. ATPN'08
, pp. 327-347
-
-
Meyer, R.1
Khomenko, V.2
Strazny, T.3
-
19
-
-
34948831406
-
-
URL
-
The NAUTY page. URL: http://cs.anu.edu.au/∼bdm/nauty/.
-
The NAUTY Page
-
-
-
20
-
-
0010728871
-
An introduction to the π-Calculus
-
J. Bergstra, A. Ponse, and S. Smolka, editors, Elsevier Sci. Pub.
-
J. Parrow. An introduction to the π-Calculus. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, pages 479-543. Elsevier Sci. Pub., 2001.
-
(2001)
Handbook of Process Algebra
, pp. 479-543
-
-
Parrow, J.1
-
21
-
-
49249124580
-
On the decidability and complexity of the structural congruence for beta-binders
-
A. Romanel and C. Priami. On the decidability and complexity of the structural congruence for beta-binders. Theoretical Computer Science, 404(1-2):156-169, 2008.
-
(2008)
Theoretical Computer Science
, vol.404
, Issue.1-2
, pp. 156-169
-
-
Romanel, A.1
Priami, C.2
-
23
-
-
0024128620
-
Graph isomorphism is in the low hierarchy
-
U. Schöning. Graph isomorphism is in the low hierarchy. J. of Comp. and Syst. Sci., 37(3):312-323, 1988.
-
(1988)
J. of Comp. and Syst. Sci.
, vol.37
, Issue.3
, pp. 312-323
-
-
Schöning, U.1
-
24
-
-
44649167785
-
The polynomial-time hierarchy
-
L. Stockmeyer. The polynomial-time hierarchy. Theor. Comp. Sci., 3(1):1-22, 1976.
-
(1976)
Theor. Comp. Sci.
, vol.3
, Issue.1
, pp. 1-22
-
-
Stockmeyer, L.1
-
26
-
-
85006239926
-
The MOBILITY WORKBENCH: A tool for the π-Calculus
-
volume 818 of LNCS, Springer-Verlag
-
B. Victor and F. Moller. The MOBILITY WORKBENCH: A tool for the π-Calculus. In Proc. CAV'94, volume 818 of LNCS, pages 428-440. Springer-Verlag, 1994.
-
(1994)
Proc. CAV'94
, pp. 428-440
-
-
Victor, B.1
Moller, F.2
|