| EPSRC Reference: |
GR/M25445/01 |
| Title: |
PROPERTIES OF INFINITE REGULAR GRAPHS |
| Principal Investigator: |
Stirling, Professor C |
| Other Investigators: |
|
| Researcher Co-Investigators: |
|
| Project Partners: |
|
| Department: |
Sch of Informatics |
| Organisation: |
University of Edinburgh |
| Scheme: |
Standard Research (Pre-FEC) |
| Starts: |
01 July 1998 |
Ends: |
30 June 1999 |
Value (£): |
3,500
|
| EPSRC Research Topic Classifications: |
| Fundamentals of Computing |
|
|
| EPSRC Industrial Sector Classifications: |
| No relevance to Underpinning Sectors |
|
|
| Related Grants: |
|
| Panel History: |
|
|
Summary on Grant Application Form |
|
It is intended that we examine the various notions of finitely generable transition systems such as regular and recognisable. The aim of this is to understand better hierarchies of families transition systems. One useful means for discriminating between such families is their closure conditions: for example, which subfamilies are closed under bisimulation equivalence. At the same time we intend to examine whether bisimulation equivalence is decidable for regular graphs and for recognisable graphs.
|
|
Key Findings |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Potential use in non-academic contexts |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Impacts |
|
| Description |
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk |
| Summary |
|
| Date Materialised |
|
|
|
|
Sectors submitted by the Researcher |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
| Project URL: |
|
| Further Information: |
|
| Organisation Website: |
http://www.ed.ac.uk |