finite axiomatization
Recently Published Documents


TOTAL DOCUMENTS

25
(FIVE YEARS 0)

H-INDEX

7
(FIVE YEARS 0)

10.29007/7gcx ◽  
2018 ◽  
Author(s):  
Andrey Kudinov

We study derivational modal logic of real line with difference modality and prove that it has finite model property but does not have finite axiomatization.


2007 ◽  
Vol 14 (5) ◽  
Author(s):  
Luca Aceto ◽  
Silvio Capobianco ◽  
Anna Ingólfsdóttir

We study Basic Process Algebra with interrupt modulo complete trace equivalence. We show that, unlike in the setting of the more demanding bisimilarity, a ground complete finite axiomatization exists. We explicitly give such an axiomatization, and extend it to a finite complete one in the special case when a single action is present.


2005 ◽  
Vol 1 (1) ◽  
Author(s):  
Luca Aceto ◽  
Wan Fokkink ◽  
Anna Ingolfsdottir ◽  
Bas Luttik

2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Luca Aceto ◽  
Willem Jan Fokkink ◽  
Anna Ingólfsdóttir ◽  
Bas Luttik

This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the recursion free fragment of Milner's Calculus of Communicating Systems. Thus the addition of a single binary operation, viz. Hennessy's merge, is sufficient for the finite equational axiomatization of parallel composition modulo this non-interleaving equivalence. This result is in sharp contrast to a theorem previously obtained by the same authors to the effect that the same language is not finitely based modulo bisimulation equivalence.


Sign in / Sign up

Export Citation Format

Share Document