On the Axiomatizability of Priority | Zendy

Luca Aceto | Zendy; Taolue Chen | Zendy; Wan Fokkink | Zendy; Anna Ingólfsdóttir | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the Axiomatizability of Priority

Author(s) -

Luca Aceto,

Taolue Chen,

Wan Fokkink,

Anna Ingólfsdóttir

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-35907-9

DOI - 10.1007/11787006_41

Subject(s) - bisimulation , equivalence (formal languages) , process calculus , equational logic , operator (biology) , computer science , algebra over a field , set (abstract data type) , mathematics , discrete mathematics , pure mathematics , theoretical computer science , programming language , rewriting , biochemistry , chemistry , repressor , gene , transcription factor

This paper studies the equational theory of bisimulation equivalence over the process algebra BCCSP extended with the priority operator of Baeten, Bergstra and Klop. It is proven that, in the presence of an infinite set of actions, bisimulation equivalence has no finite, sound, ground-complete equational axiomatization over that language. This negative result applies even if the syntax is extended with an arbitrary collection of auxiliary operators, and motivates the study of axiomatizations using equations with action predicates as conditions. In the presence of an infinite set of actions, it is shown that, in general, bisimulation equivalence has no finite, sound, ground-complete axiomatization consisting of equations with action predicates as conditions over the language studied in this paper. Finally, sucient conditions on the priority structure

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