BIROn - Birkbeck Institutional Research Online

    On the axiomatizability of priority

    Aceto, L. and Chen, Taolue and Fokkink, W.J. and Ingolfsdottir, A. (2006) On the axiomatizability of priority. In: Bugliesi, M. and Preneel, B. and Sassone, V. and Wegener, I. (eds.) ICALP 2006: Automata, Languages and Programming, 33rd International Colloquium. Lecture Notes in Computer Science 4052. Springer, pp. 480-491. ISBN 9783540359074.

    Full text not available from this repository.


    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 conditional equations. 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 conditional equations over BCCSP. Sufficient conditions on the priority structure over actions are identified that lead to a finite, ground-complete axiomatization of bisimulation equivalence using conditional equations.


    Item Type: Book Section
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Depositing User: Sarah Hall
    Date Deposited: 09 Feb 2021 19:26
    Last Modified: 09 Aug 2023 12:50


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item