Hostname: page-component-669899f699-ggqkh Total loading time: 0 Render date: 2025-04-25T20:36:57.557Z Has data issue: false hasContentIssue false
  • English
  • Français

Minimisation and minimal realisation in Span(Graph)

Published online by Cambridge University Press:  23 September 2004

ROBERT ROSEBRUGH ,
NICOLETTA SABADINI  and
ROBERT F. C. WALTERS
ROBERT ROSEBRUGH
Affiliation:
Department of Mathematics and Computer Science, Mount Allison University, Sackville, N. B. E4L 1E6, Canada
NICOLETTA SABADINI
Affiliation:
Dipartimento di Scienze Chimiche, Fisiche e Matematica, Università dell'Insubria, via Valleggio, 11, Como, Italy
ROBERT F. C. WALTERS
Affiliation:
Dipartimento di Scienze Chimiche, Fisiche e Matematica, Università dell'Insubria, via Valleggio, 11, Como, Italy
Get access Rights & Permissions [Opens in a new window]

Abstract

The context of this article is a program studying the bicategory of spans of graphs as an algebra of processes, with applications to concurrency theory. The objective here is to study functorial aspects of reachability, minimisation and minimal realisation. The compositionality of minimisation has application to model-checking.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 14 , Issue 5 , October 2004 , pp. 685 - 714
Copyright
2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable