The University of Southampton
University of Southampton Institutional Repository

Finite State Automata for Topological Sorting

Mitchell, Bill (2001) Finite State Automata for Topological Sorting

Record type: Other


A specification of concurrent communicating processes represents a causal relationship of the events contained in the specification. It is very simple to model this as a finite partial order over the set of events when the specification contains no iteration (e.g. for an MSC with no loop constructs). When there is iteration it is far more complex to express the causal relationships between the events within a mathematical setting. This paper first explores, in section 2, how to describe all total extensions of a partial order as a finite state automaton (FSA). These total extensions represent the test scripts for a specification when there is no iteration. Then, in section 3 we extend these ideas to specifications which contain complex iterations. For MSC this means the inline loop construct. Section 3.2 describes the algorithm for characterising an iterative specification as a FSA.

PDF fsa.pdf - Other
Available under License Other.
Download (119kB)

More information

Accepted/In Press date: 2001
Organisations: Electronics & Computer Science, IT Innovation


Local EPrints ID: 267411
PURE UUID: 4a2e76c9-d4f4-4294-977c-d8c220fcc11f

Catalogue record

Date deposited: 28 May 2009 13:37
Last modified: 18 Jul 2017 07:04

Export record


Author: Bill Mitchell

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.