Event Identifier Logic

Phillips, Iain; Ulidowski, Irek

doi:10.1017/s0960129513000510

Cited by 13 publications

(7 citation statements)

References 41 publications

(77 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Future work could include formulating labelled versions of reversible event structures and bisimulations and modal logics for them as in [17] and [2,19], establishing that our RPESs and RAESs are special cases of the reversible event structures in [21], modelling reversible process calculi, and extending existing work on domains and categories for event structures to the present models.…”

Section: Conclusion and Further Workmentioning

confidence: 99%

Reversibility and asymmetric conflict in event structures

Phillips

Ulidowski

2015

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

Reversible computation has attracted increasing interest in recent years, with applications in hardware, software and biochemistry. We introduce reversible forms of prime event structures and asymmetric event structures. In order to control the manner in which events are reversed, we use asymmetric conflict on events. We prove a number of results about reachable configurations; for instance, we show under what conditions reachable configurations which are finite are reachable by purely finite means. We discuss, with examples, reversing in causal order, where an event is only reversed once all events it caused have been reversed, as well as forms of non-causal reversing.

show abstract

Section: Conclusion and Further Workmentioning

confidence: 99%

Reversibility and asymmetric conflict in event structures

Phillips

Ulidowski

2015

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…A hierarchy of equivalences with backward transitions, including hereditary history-preserving bisimilarity, was studied in the context of stable configuration structures in [31]. A logic with reverse as well as forward modalities which characterises hereditary history-preserving bisimilarity was introduced in [32].…”

Section: Related Workmentioning

confidence: 99%

Forward-Reverse Observational Equivalences in CCSK

Lanese

Phillips

2021

Reversible Computation

Self Cite

View full text Add to dashboard Cite

show abstract

“…Many logics have been defined to reason about the behaviour of processes with noninterleaving (causal, partial order, true-concurrency) semantics. For instance, see [2,3,5,6,12,13,20,[23][24][25][26], and the references therein. The main questions addressed in these papers include satisfiability, model checking, and equivalence checking.…”

Section: Concluding Remarks and Related Workmentioning

confidence: 99%

“…The main questions addressed in these papers include satisfiability, model checking, and equivalence checking. In particular, the work in [3,20,26] focused on coincidence results between logical equivalences and equivalences for concurrency in very general settings. Positive results can be found in some of the papers cited mentioned, especially in [3] where the logical equivalences induced by many logics are shown to correspond to some of the best-known bisimulation equivalences for 'trueconcurrency' (i.e., for concurrent processes with partial order semantics).…”

Section: Concluding Remarks and Related Workmentioning

confidence: 99%

On fixpoint logics and equivalences for processes with restricted nondeterminism

Gutiérrez

2015

Journal of Logic and Computation

View full text Add to dashboard Cite

In concurrency, processes can be studied using a partial order or an interleaving semantics. In partial order semantics, at least four different kinds of behaviour can be recognised: concurrency, causality, conflict, and confusion. In interleaving semantics, only conflicts can be observed. All these features can be characterised in logical terms, and various logics have been defined for this purpose. For instance, Hennessy-Milner logic is a modal language that captures strong bisimilarity, the standard bisimulation equivalence for processes with interleaving semantics. However, when considering processes with partial order semantics, stronger equivalences are used and more discriminating logics are needed. In the present paper, we study conditions to ease the definition of such logics and equivalences for processes with partial order semantics. More specifically, we study the impact that nondeterminism can have on some fixpoint modal logics and bisimulation equivalences for concurrent and multi-agent systems, when it is systematically restricted within the four kinds of behaviour mentioned above. Our results show that when the concurrency and confusion relations are taken to be deterministic, then the main equivalence for causal behaviour can be completely captured (even in logical and game-theoretic terms) by a simpler, weaker, more local bisimulation relation. We also provide key examples of the kinds of processes that can be modelled using deterministic confusion in order to illustrate the expressive power of the general framework defined here.

show abstract

Event Identifier Logic

Cited by 13 publications

References 41 publications

Reversibility and asymmetric conflict in event structures

Reversibility and asymmetric conflict in event structures

Forward-Reverse Observational Equivalences in CCSK

On fixpoint logics and equivalences for processes with restricted nondeterminism

Contact Info

Product

Resources

About