On the expressibility of priority

Authors:
Luca Aceto;Anna Ingolfsdottir
Affiliations:
School of Computer Science, Reykjavík University, Iceland;School of Computer Science, Reykjavík University, Iceland
Venue:
Information Processing Letters
Year:
2008

Citing 7
Cited 1

A calculus of mobile processes, II

Information and Computation
Bisimulation can't be traced

Journal of the ACM (JACM)
Ntyft/ntyxt rules reduce to ntree rules

Information and Computation
Communication and Concurrency

Communication and Concurrency
CCS with Priority Guards

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Full Abstraction in Structural Operational Semantics (Extended Abstract)

AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Compositionality of Hennessy-Milner logic by structural operational semantics

Theoretical Computer Science - Foundations of computation theory (FCT 2003)

Modular semantics for transition system specifications with negative premises

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

This short note offers results confirming that the priority operator of Baeten, Bergstra and Klop cannot be expressed using positive rule formats for operational semantics. Although expected, this inexpressibility result does not seem to have appeared before in the literature.