Process languages with discrete relative time based on the Ordered SOS format and rooted eager bisimulation
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. (C) Published by Elsevier Inc.
process languages discrete relative time structured operational semantics timed process languages formats of sos rules ordered sos format and rooted eager bisimulation ordered format process preorders rooted eager bisimulation and timed rooted eager bisimulation timed properties time determinacy, time synchrony, maximal progress, patience, urgency, weak timelock freeness, constancy of offers and time persistence congruence results