@inproceedings{772d053a1b004c459950373ad868dc88,
title = "Continuous action system refinement",
abstract = "Action systems are a framework for reasoning about discrete reactive systems. Back, Petre and Porres have extended these action systems to continuous action systems, which can be used to model hybrid systems. In this paper we define a refinement relation, and develop practical data refinement rules for continuous action systems. The meaning of continuous action systems is expressed in terms of a mapping from continuous action systems to action systems. First, we present a new mapping from continuous action systems to action systems, such that Back's definition of trace refinement is correct with respect to it. Second, we present a stream semantics that is compatible with the trace semantics, but is preferable to it because it is more general. Although action system trace refinement rules are applicable to continuous action systems with a stream semantics, they are not complete. Finally, we introduce a new data refinement rule that is valid with respect to the stream semantics and can be used to prove refinements that are not possible in the trace semantics, and we analyse the completeness of our new rule in conjunction with the existing trace refinement rules.",
author = "Larissa Meinicke and Hayes, {Ian J.}",
year = "2006",
doi = "10.1007/11783596_19",
language = "English",
isbn = "3540356312",
volume = "4014 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "316--337",
editor = "Tarmo Uustalu",
booktitle = "Mathematics of Program Construction - 8th International Conference, MPC 2006, Proceedings",
address = "United States",
note = "8th International Conference on Mathematics of Program Construction, MPC 2006 ; Conference date: 03-07-2006 Through 05-07-2006",
}