Eugene Yip
Eugene Yip has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Gerald Lüttgen
University of Bamberg
2 shared publications - Matthew M. Y. Kuo
Computer and Information Sciences Department, Auckland University of Technology, Auckland, New Zealand
2 shared publications - Jamie Lee
Computer and Information Sciences Department, Auckland University of Technology, Auckland, New Zealand
1 shared publication - Nathan Allen
Auckland University of Technology
1 shared publication
Latest Publications
- Open Access
- 28 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 81-85
Optimising the Scheduling of System Level Logical Execution Time Systems
- 28 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 81-85
Open AccessOptimising the Scheduling of System Level Logical Execution Time Systems
- Open Access
- 1 January 2024
- Published by Universitatsbibliothek Bamberg
Heterogeneous Specification of Spacecraft Software
The operational behaviour of a reactive system is commonly specified or modelled as concurrent state machines, where each machine models the possible states or modes of a software component and its interactions with the environment. However, state machines can quickly become verbose when execution constraints between concurrent states need to be modelled. Alternatively, constraints could be modelled declaratively as special edges between states. Such a heterogeneous modelling approach is employed by Virtual Satellite (VirSat), a model-based systems engineering tool from the German Aerospace Center (DLR). The challenge has been to develop a heterogeneous modelling framework that supports an operational and declarative syntax, defines a unified semantics suitable for formal reasoning, and supports the independent and incremental development of software components. We address this challenge with our Component State Machine (CSM) formalism as a means to operationalise VirSat: the operational syntax of VirSat is preserved in CSM, the declarative VirSat constraints are transformed into CSM atomic propositions and parallel conditions, the CSM parallel operator incrementally composes CSMs and resolves the parallel conditions, and design errors are analysed as inconsistent transitions. CSM permits new constraints to be defined without needing to modify the core VirSat semantics. We also propose an intuitive, practical, and mathematically rigorous notion of refinement that aims to encourage a more systematic development of spacecraft software. Lastly, we offer a modular implementation of CSMs as hierarchically scheduled Executable State Machines (ESMs) that remains open to further composition and refinement.
- 1 January 2024
- Published by Universitatsbibliothek Bamberg
Open AccessHeterogeneous Specification of Spacecraft Software
The operational behaviour of a reactive system is commonly specified or modelled as concurrent state machines, where each machine models the possible states or modes of a software component and its interactions with the environment. However, state machines can quickly become verbose when execution constraints between concurrent states need to be modelled. Alternatively, constraints could be modelled declaratively as special edges between states. Such a heterogeneous modelling approach is employed by Virtual Satellite (VirSat), a model-based systems engineering tool from the German Aerospace Center (DLR). The challenge has been to develop a heterogeneous modelling framework that supports an operational and declarative syntax, defines a unified semantics suitable for formal reasoning, and supports the independent and incremental development of software components. We address this challenge with our Component State Machine (CSM) formalism as a means to operationalise VirSat: the operational syntax of VirSat is preserved in CSM, the declarative VirSat constraints are transformed into CSM atomic propositions and parallel conditions, the CSM parallel operator incrementally composes CSMs and resolves the parallel conditions, and design errors are analysed as inconsistent transitions. CSM permits new constraints to be defined without needing to modify the core VirSat semantics. We also propose an intuitive, practical, and mathematically rigorous notion of refinement that aims to encourage a more systematic development of spacecraft software. Lastly, we offer a modular implementation of CSMs as hierarchically scheduled Executable State Machines (ESMs) that remains open to further composition and refinement.
- Open Access
- 1 January 2024
- Published by Universitatsbibliothek Bamberg
Concurrency, Shared Variables, Compositionality : An Unlikely Triple
This paper reports our experiences with extending Interface Automaton (IA) with shared variables by lifting IA’s intuitive notion of refinement and compositionality to shared variables. Although there are existing works that introduce shared variables to IA, they typically support a very restricted notion of sharing, e.g., the value of a shared variable is only defined for the duration of an atomic operation, with no ability to persist values for subsequent operations. When attempting to formulate the semantics of shared variables that could persist their values across operations, we encountered numerous challenges when defining a notion of refinement that respected compositionality. We conjecture that, even for a basic notion of variable persistence, concurrent shared variable accesses between automata create a tight data dependency that prevents a compositional reasoning. We discuss the generality of this negative result in relation to other concurrency theories.
- 1 January 2024
- Published by Universitatsbibliothek Bamberg
Open AccessConcurrency, Shared Variables, Compositionality : An Unlikely Triple
This paper reports our experiences with extending Interface Automaton (IA) with shared variables by lifting IA’s intuitive notion of refinement and compositionality to shared variables. Although there are existing works that introduce shared variables to IA, they typically support a very restricted notion of sharing, e.g., the value of a shared variable is only defined for the duration of an atomic operation, with no ability to persist values for subsequent operations. When attempting to formulate the semantics of shared variables that could persist their values across operations, we encountered numerous challenges when defining a notion of refinement that respected compositionality. We conjecture that, even for a basic notion of variable persistence, concurrent shared variable accesses between automata create a tight data dependency that prevents a compositional reasoning. We discuss the generality of this negative result in relation to other concurrency theories.
- Open Access
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 349-354
LetSynchronise: An Open-Source Framework for Analysing and Optimising Logical Execution Time Systems
The paper presents early work on LetSynchronise, an open-source framework that aims to facilitate research and collaboration on Logical Execution Time (LET) systems. It offers a web application for modelling, simulating, analysing, and optimising LET systems, which can be extended via user-defined plugins for the rapid prototyping of scheduling policies, timing analysers, and optimisation algorithms. Its capabilities are demonstrated through use cases and a small research case study.
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 349-354
Open AccessLetSynchronise: An Open-Source Framework for Analysing and Optimising Logical Execution Time Systems
The paper presents early work on LetSynchronise, an open-source framework that aims to facilitate research and collaboration on Logical Execution Time (LET) systems. It offers a web application for modelling, simulating, analysing, and optimising LET systems, which can be extended via user-defined plugins for the rapid prototyping of scheduling policies, timing analysers, and optimisation algorithms. Its capabilities are demonstrated through use cases and a small research case study.