Minimisation and minimal realisation in Span(Graph)

Authors:
Robert Rosebrugh;Nicoletta Sabadini;Robert F. C. Walters
Affiliations:
Department of Mathematics and Computer Science, Mount Allison University, Sackville, N. B. E4L 1E6, Canada;Dipartimento di Scienze Chimiche, Fisiche e Matematica, Università dell'Insubria, via Valleggio, 11, Como, Italy;Dipartimento di Scienze Chimiche, Fisiche e Matematica, Università dell'Insubria, via Valleggio, 11, Como, Italy
Venue:
Mathematical Structures in Computer Science
Year:
2004

Citing 9
Cited 2

Compositional model checking

Proceedings of the Fourth Annual Symposium on Logic in computer science
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
Synthesis of concurrent systems with many similar processes

ACM Transactions on Programming Languages and Systems (TOPLAS)
The topos of labelled trees: a categorical semantics for SCCS

Fundamenta Informaticae
Span(Graph): A Categorial Algebra of Transition Systems

AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Representing Place/Transition Nets in Span(Graph)

AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
On Observing Nondeterminism and Concurrency

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Unique factorisation lifting functors and categories of linearly-controlled processes

Mathematical Structures in Computer Science
Minimal realization in bicategories of automata

Mathematical Structures in Computer Science

Calculating Colimits Compositionally

Concurrency, Graphs and Models
Compositional Minimization in Span(Graph): Some Examples

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

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.