Behavioural equivalence relations induced by programming logics

Brookes, Stephen; Rounds, William C.

doi:10.1007/bfb0036900

Cited by 36 publications

(21 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A modal characteristic of observational equivalence is given in [ 161 and is further elaborated in [4] and [32]. Our modal characterization theorem is modeled on [35], but is actually a minor variation on a result first proved by C. Stirling [33].…”

Section: Resultsmentioning

confidence: 99%

Acceptance trees

Hennessy

1985

J. ACM

128

View full text Add to dashboard Cite

A simple model, AT, for nondeterministic machines is presented which is based on certain types of trees. A set of operations, 2, is defined over AT and it is shown to be completely characterized by a set of inequations over 2. AT is used to define the denotational semantics of a language for defining nondeterministic machines. The significance ofthe model is demonstrated by showing that this semantics reflects an intuitive operational semantics of machines based on the idea that machines should only be differentiated if there is some experiment that differentiates between them.

show abstract

Section: Resultsmentioning

confidence: 99%

Acceptance trees

Hennessy

1985

J. ACM

128

View full text Add to dashboard Cite

show abstract

“…They are known to preserve all temporal logic properties [20], including nonblocking. Observation equivalence alone is responsible for a substantial state-space reduction in compositional nonblocking verification of FAs [11].…”

Section: Symbolic Observation Equivalencementioning

confidence: 99%

Compositional nonblocking verification for extended finite-state automata using partial unfolding

Mohajerani

Malik

Fabian

2013

2013 IEEE International Conference on Automation Science and Engineering (CASE)

View full text Add to dashboard Cite

This paper describes a framework for compositional nonblocking verification of discrete event systems modelled as extended finite-state automata. Compositional verification is shown in previous work to be efficient to verify the nonblocking property of large discrete event systems. Here, these results are applied to extended finite-state automata communicating via shared variables and events. The model to be verified is composed gradually, partially unfolding variables as needed. At each step, symbolic observation equivalence is used to simplify the resultant components in such a way that the final verification result is the same as it would have been for the original model. The paper concludes with an example showing the potential of compositional verification to achieve substantial state-space reduction.

show abstract

“…Bisimulations on transition systems provide a powerful concept (see [1,3] ), but many authors argue ( [4,6,28], to mention but a few) that this yields an inadequate description of concurrency; specifically what is questioned is Milner's expansion theorem [17,14], expressing a simulation of concurrency by sequential non-determinism. Roughly speaking (a I b) = ab + ba, thus the parallel composition operator can be eliminated (from finite terms), whence it is not primitive.…”

Section: (At(b + ~)) + (Aib) + ((A + C)ib) = (Al(b + 4) + ((~ + ~)Tb)mentioning

confidence: 99%

“…Here we adapt Brookes and Rounds terminology (see [3,1] The only point to check is that the composition of invariant relations is itself invariant m We shall call this equisimulation the equipollence with respect to T and sometimes use the alternative notation p × q (T) instead of p x T qWe are in fact interested in transitions labelled by actions, that is classes of structures or terms. Let us ambiguously denote ~PI and IP~ the isomorphism class of the A-LES P and the =e-class of the term p. Then we define the transition relations ~ and…”

Section: Equipoflencementioning

confidence: 99%