| EPSRC Reference: |
GR/R42245/01 |
| Title: |
Infinite State Processes |
| 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 April 2001 |
Ends: |
31 March 2002 |
Value (£): |
2,870
|
| EPSRC Research Topic Classifications: |
| Fundamentals of Computing |
|
|
| EPSRC Industrial Sector Classifications: |
|
| Related Grants: |
|
| Panel History: |
|
|
Summary on Grant Application Form |
|
Process algebra generalises future automata. They are infinite state automata where the states are defined by systematic rules. They also have algebraic structure. To make process algebras a more realistic model of everyday machines one abstracts from 'internal activity'. Formally one uses 'weak biomulations equilvalance' as the equality between processes. Little is known about when weak equivalence is decidable between processes. The aim is to increase understanding of this problem.
|
|
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 |