Robin Milner
Robin Milner

Homepage

  Affiliation history
Bibliometrics: publication history
Average citations per article87.22
Citation Count8,460
Publication count97
Publication years1971-2013
Available for download14
Average downloads per article1,046.57
Downloads (cumulative)14,652
Downloads (12 Months)874
Downloads (6 Weeks)102
A. M. Turing Award Winner ACM Fellow
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


97 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 97
Result page: 1 2 3 4 5

Sort by:

1
March 2013 Formal Aspects of Computing: Volume 25 Issue 2, March 2013
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching in bigraphs with binding. Our results yield a specification for a provably correct matching algorithm, as needed by our prototype tool implementing bigraphical reactive systems.
Keywords: Bigraphs, Bigraphical reactive systems, Matching, Complete inductive characterization

2
September 2009 CONCUR 2009: Proceedings of the 20th International Conference on Concurrency Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Bigraphs are a candidate model that aims to provide a theoretical platform for ubiquitous computing systems. This short paper summarises the categories, and the functors between them, that represent the structure of that theory.
Keywords: bigraph, process, ubiquitous computing, category

3
March 2009
Bibliometrics:
Citation Count: 0

Computer science is no longer just a technology--for nearly all of us, it has become a way of life. Whether we spend our days surfing the Internet, or merely use an automatic teller machine on occasion, computers have affected our lives. This collection of sixteen original essays by distinguished computer ...

4
October 2008 Electronic Notes in Theoretical Computer Science (ENTCS): Volume 218, October, 2008
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 32

In this paper we present a stochastic semantics for Bigraphical Reactive Systems. A reduction and a labelled stochastic semantics for bigraphs are defined. As a sanity check, we prove that the two semantics are consistent with each other. We illustrate the expressiveness of the framework with an example of membrane ...
Keywords: membrane budding, stochastic semantics, Directed bigraph

5
June 2008 Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

I am delighted to be able to share in celebrating Ugo's birthday, if not with a formal paper then at least with some loosely-knit philosophical ideas. I have worked on ideas similar to Ugo's for most of our careers. Ugo had much to do with the stream of expert Italians, ...

6
April 2008 Electronic Notes in Theoretical Computer Science (ENTCS): Volume 209, April, 2008
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 13

Bigraphs are a framework in which both existing process calculi and new models of behaviour can be formulated, yielding theory that is shared among these models. A short survey of the main features of bigraphs is presented, showing how they can be developed from standard graph theory using elementary category ...
Keywords: Process Calculi, Bigraphs

7
July 2007 Electronic Notes in Theoretical Computer Science (ENTCS): Volume 175 Issue 4, July, 2007
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 8

We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for a provably correct matching algorithm, as needed for an implementation of bigraphical reactive systems.
Keywords: bigraphical reactive systems, Bigraphs, complete inductive characterization, matching

8
June 2007 Electronic Notes in Theoretical Computer Science (ENTCS): Volume 175 Issue 3, June, 2007
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 17

The notion of confluence is studied on the context of bigraphs. Confluence will be important in modelling real-world systems, both natural (as in biology) and artificial (as in pervasive computing). The paper uses bigraphs in which names have multiple locality; this enables a formulation of the lambda calculus with explicit ...
Keywords: confluence, lambda calculus, bigraph, locality

9 published by ACM
January 2007 ACM Turing award lectures
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 39,   Downloads (12 Months): 296,   Downloads (Overall): 1,386

Full text available: PDFPDF
Keywords: interaction, CCS, naming and reference, process algebra, process calculus, reduction rule, pi calculus

10
December 2006 Mathematical Structures in Computer Science: Volume 16 Issue 6, December 2006
Publisher: Cambridge University Press
Bibliometrics:
Citation Count: 12

A framework is defined within which reactive systems can be studied formally. The framework is based on s-categories , which are a new variety of categories within which reactive systems can be set up in such a way that labelled transition systems can be uniformly extracted. These lead in turn ...

11
July 2006 The Computer Journal: Volume 49 Issue 4, July 2006
Publisher: Oxford University Press
Bibliometrics:
Citation Count: 7


12
January 2006 Information and Computation: Volume 204 Issue 1, January 2006
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 40

Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigraphical reactive system (Brs) in which bigraphs can reconfigure themselves. Following an earlier paper describing link graphs, a constituent of bigraphs, this paper is a ...

13
January 2006 Transactions on Computational Systems Biology IV
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

It is a big honour to be able to speak at one of the most exciting conferences I have been to for 20 years. I feel in some ways daunted because, although the development of connections between biology and computer science may seem wonderful from outside, we know that they ...

14
January 2006 Information and Computation: Volume 204 Issue 1, January 2006
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 12

Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigraphical reactive system (Brs) in which bigraphs can reconfigure themselves. Following an earlier paper describing link graphs, a constituent of bigraphs, this paper is a ...

15
December 2005 Mathematical Structures in Computer Science: Volume 15 Issue 6, December 2005
Publisher: Cambridge University Press
Bibliometrics:
Citation Count: 14

This paper axiomatises the structure of bigraphs, and proves that the resulting theory is complete. Bigraphs are graphs with double structure, representing locality and connectivity. They have been shown to represent dynamic theories for the $\pi$-calculus, mobile ambients and Petri nets in a way that is faithful to each of ...

16
January 2005 Formal Methods in Software and Systems Modeling: essays dedicated to Hartmut Ehrig on the occasion of his 60th birthday
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Graph-rewriting has been a growing discipline for over three decades. It grew out of the study of graph grammars, in which – analogously to string and tree grammars – a principal interest was to describe the families of graphs that could be generated from a given set of productions. A ...

17
January 2005 The Computer Journal: Volume 48 Issue 1, January 2005
Publisher: Oxford University Press
Bibliometrics:
Citation Count: 2

What are the major research challenges that face the world of computing today? Are there any of them that match the grandeur of well-known challenges in other branches of science? This article is a report on an exercise by the Computing Research Community in the UK to answer these questions, ...

18 published by ACM
January 2003 POPL '03: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Publisher: ACM
Bibliometrics:
Citation Count: 46
Downloads (6 Weeks): 3,   Downloads (12 Months): 24,   Downloads (Overall): 726

Full text available: PdfPdf
A bigraphical reactive system (BRS) involves bigraphs , in which the nesting of nodes represents locality, independently of the edges connecting them. BRSs represent a wide variety of calculi for mobility, including λ-calculus and ambient calculus. A labelled transition system (LTS) for each BRS is here derived uniformly, adapting previous ...
Keywords: λ-calculus, reactive system, bigraph, bisimilarity, mobile computation, transition system
Also published in:
January 2003  ACM SIGPLAN Notices: Volume 38 Issue 1, January 2003

19
October 2002 ICGT '02: Proceedings of the First International Conference on Graph Transformation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

A bigraphical reactive system (BRS) involves bigraphs, in which the nesting of nodes represents locality, independently of the edges connecting them. BRSs represent a wide variety of calculi for mobility, including the �-calculus. This short essay explains how bigraphs compose, and uses the �-calculus to illustrate how they already provide ...

20
July 2002 Formal Aspects of Computing: Volume 13 Issue 3-5, July 2002
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Action calculi, which generalise process calculi such as Petri nets, ź-calculusand ambient calculus, have been presented in terms of action graphs. We here offer linear action graphs as a primitive basis for action calculi. This paper presents the category of embeddings of undirected linear action graphs without nesting, using a ...
Keywords: Keywords: Action calculus; Graph embedding; Process calculus



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us