A Calculus Based on Absence of Actions
Padmanabhan Krishnan
Abstract
Open-access reader
Padmanabhan Krishnan
Abstract
Open-access reader
In this article we present a process algebra where the behaviour can be specified when certain actions cannot be exhibited. This is useful in specifying time outs, interrupts etc. We present a few properties which form the basis for a sound and complete axiomatisation of a bisimulation equivalence relation. A comparison with other approaches is presented.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this article we present a process algebra where the behaviour can be specified when certain actions cannot be exhibited. This is useful in specifying time outs, interrupts etc. We present a few properties which form the basis for a sound and complete axiomatisation of a bisimulation equivalence relation. A comparison with other approaches is presented.
Key concepts: Bisimulation, Process calculus, Equivalence (formal languages), Calculus (dental), Relation (database), Algebra over a field, Basis (linear algebra), Equivalence relation