Action Refinement for Real-Time Concurrent Processes with Urgency | Zendy

Guangping Qin | Zendy; Jinzhao Wu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Action Refinement for Real-Time Concurrent Processes with Urgency

Author(s) -

Guangping Qin,

Jinzhao Wu

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.09.002

Subject(s) - congruence relation , process calculus , bisimulation , equivalence (formal languages) , computer science , programming language , trace (psycholinguistics) , bundle , concurrency , denotational semantics , theoretical computer science , operational semantics , semantics (computer science) , algebra over a field , mathematics , discrete mathematics , pure mathematics , linguistics , philosophy , materials science , composite material

We propose an action refinement approach for real-time concurrent processes with urgent interactions, where a partial-order setting, timed bundle event structures, is used as the system model and a real-time LOTOS-like process algebra is used as the specification language. We show that the refinement approach has the commonly expected properties: (1) The behaviour of the refined process can be inferred compositionally from the behaviour of the original process and from the behaviour of the processes substituted for actions; (2) The timed extensions of pomset trace equivalence and history preserving bisimulation equivalence are both congruences under the refinement; (3) The syntactic and semantic refinements coincide up to the aforementioned equivalence relations with respect to a cpo-based denotational semantics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research