Toggle Main Menu Toggle Search

Open Access padlockePrints

The Newcastle University research output collection, currently available on ePrints, will shortly be moving to a new open repository platform, Figshare. To prepare for the data migration we have paused adding new content to ePrints, and will resume once the new repository is launched. During this time you will continue to have access to ePrints (but no new content will appear). We will share updates here when available.

A Proof-Based Method for Modelling Timed Systems

Lookup NU author(s): Dr Alexei Iliasov, Dr Jeremy Bryans

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

We present a novel method for reasoning about time in state-based proof-oriented formalisms. The method builds on a non-classical model of time, the Leibnizian model, in which time is a relative property determined by the observations of an evolving subject, rather than one of the fundamental dimensions. It proves to be remarkably effective in the context of the Event-B formalism. We illustrate the method with a machine-checked proof of Fischer's algorithm that, to our knowledge, is simpler than other proofs available in the literature.

Publication metadata

Author(s): Iliasov A, Bryans J

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Perspectives of System Informatics

Year of Conference: 2015

Pages: 161-176

Print publication date: 01/01/2015

Acceptance date: 01/01/1900

ISSN: 0302-9743

Publisher: Springer Berlin Heidelberg

URL: http://dx.doi.org/10.1007/978-3-662-46823-4_14

DOI: 10.1007/978-3-662-46823-4_14

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783662468227

Share