Skip to main content
Article thumbnail
Location of Repository

Process languages with discrete relative time based on the Ordered SOS format and rooted eager bisimulation

By Irek Ulidowski and S. Yuen


We propose a uniform framework, based on the Ordered Structural Operational Semantics (OSOS) approach of Ulidowski and Phillips [Information and Computation 178 (1) (2002) 180], for process languages with discrete relative time. Our framework allows the user to select favourite process operators, whether they are standard operators or new application-specific operators, provided that they are OSOS definable and their OSOS rules satisfy several simple conditions. The obtained timed process languages preserve a timed version of rooted eager bisimulation preorder and the time determinacy property. We also propose several additional conditions on the type of OSOS definitions for the operators so that several other properties which reflect the nature of time passage, such as the maximal progress, patience and time persistence properties, are also satisfied

Year: 2004
DOI identifier: 10.1016/j.jlap.2004.03.002
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.