Conference ProceedingsOPEN ACCESS

A theory of distributing train rescheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1051 499-517
DOI: 10.1007/3-540-60973-3_104
4Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We outline the formal modelling of a software system to support the scheduling and rescheduling of trains. The current (prototype) system supports only centralized rescheduling, but in practice rescheduling is done on an area basis, and a distributed system is required. Developing a distributed system involves the notions of delegability of functions to adjust schedules and distributability of functions to analyse them for conformance to regulations. We formalize these notions in terms of a more abstract, generic specification and then instantiate this to generate a specification of the distributed system.

Cite

CITATION STYLE

APA

George, C. (1996). A theory of distributing train rescheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1051, pp. 499–517). Springer Verlag. https://doi.org/10.1007/3-540-60973-3_104

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free