Results 1  10
of
1,059
Axiomatising divergence
 Information and Computation
, 2005
"... Abstract. This paper develops sound and complete axiomatisations for the divergence sensitive spectrum of weak bisimulation equivalence. The axiomatisations can be extended to a considerable fragment of the linear time – branching time spectrum with silent moves, partially solving an open problem po ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Abstract. This paper develops sound and complete axiomatisations for the divergence sensitive spectrum of weak bisimulation equivalence. The axiomatisations can be extended to a considerable fragment of the linear time – branching time spectrum with silent moves, partially solving an open problem
Axiomatising Divergence
"... When a process is capable of executing an unbounded number of nonobservable actions it is said to be divergent. Different capabilities of an observer to identify this phenomen along the execution leads to different divergent sensitive semantics. This paper develops sound and complete axiomatisation ..."
Abstract
 Add to MetaCart
axiomatisations for the divergence sensitive spectrum of weak bisimulation equivalence. The axiomatisations separates the axioms concerning recursion and those that capture the essence of diverging behaviour.
Axiomatising Divergence
, 2002
"... This paper develops sound and complete axiomatisations for the divergence sensitive spectrum of weak bisimulation equivalence. The axiomatisations can be extended to a considerable fragment of the linear time  branching time spectrum with silent moves, partially solving an open problem posed in [5 ..."
Abstract
 Add to MetaCart
This paper develops sound and complete axiomatisations for the divergence sensitive spectrum of weak bisimulation equivalence. The axiomatisations can be extended to a considerable fragment of the linear time  branching time spectrum with silent moves, partially solving an open problem posed
Collège doctoral Axiomatisations and Types
, 2005
"... The focus of this thesis are the theoretical foundations for reasoning about algorithms and protocols for modern distributed systems. Two important features of models for these systems are probability and typed mobility: probabilities can be used to quantify unreliable or unpredictable behaviour an ..."
Abstract
 Add to MetaCart
combines both nondeterministic and probabilistic behaviour in the style of Segala and Lynch’s probabilistic automata. We consider various strong and weak behavioural equivalences, and we provide complete axiomatisations for finitestate processes, restricted to guarded recursion in the case of the weak
Priority and Maximal Progress are completely axiomatisable (Extended Abstract)
, 1998
"... . During the last decade, CCS has been extended in different directions, among them priority and real time. One of the most satisfactory results for CCS is Milner's complete proof system for observational congruence [28]. Observational congruence is fair in the sense that it is possible to esca ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
to escape divergence, reflected by an axiom recX:(ø:X + P ) = recX:ø:P . In this paper we discuss observational congruence in the context of interactive Markov chains, a simple stochastic timed variant CCS with maximal progress. This property implies that observational congruence becomes unfair, i
Bisimulation is not Finitely (First Order) Equationally Axiomatisable
 in Proceedings 9 th Annual Symposium on Logic in Computer Science
, 1994
"... This paper considers the existence of finite equational axiomatisations of bisimulation over a calculus of finite state processes. To express even simple properties such as ¯XE = ¯XE[E=X] equationally it is necessary to use some notation for substitutions. Accordingly the calculus is embedded in a s ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
This paper considers the existence of finite equational axiomatisations of bisimulation over a calculus of finite state processes. To express even simple properties such as ¯XE = ¯XE[E=X] equationally it is necessary to use some notation for substitutions. Accordingly the calculus is embedded in a
Axiomatisations of Weak Equivalences for De Simone Languages
 Proceedings of the 6th International Conference on Concurrency Theory CONCUR'95
, 1995
"... . Aceto, Bloom and Vaandrager proposed in [ABV92] a procedure for generating a complete axiomatisation of strong bisimulation for process languages in the GSOS format. However, the choice operator +, which the procedure uses, as well as other auxiliary GSOS operators, which it introduces to obtain a ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
. Aceto, Bloom and Vaandrager proposed in [ABV92] a procedure for generating a complete axiomatisation of strong bisimulation for process languages in the GSOS format. However, the choice operator +, which the procedure uses, as well as other auxiliary GSOS operators, which it introduces to obtain
Is Observational Congruence Axiomatisable in Equational Horn Logic?
"... It is well known that bisimulation on µexpressions cannot be finitely axiomatised in equational logic. Complete axiomatisations such as those of Milner and Bloom / Ésik necessarily involve implicational rules. However, both systems rely on features which go beyond pure equational Horn logic: either ..."
Abstract
 Add to MetaCart
It is well known that bisimulation on µexpressions cannot be finitely axiomatised in equational logic. Complete axiomatisations such as those of Milner and Bloom / Ésik necessarily involve implicational rules. However, both systems rely on features which go beyond pure equational Horn logic
Is Observational Congruence on µExpressions Axiomatisable in Equational Horn Logic?
, 2007
"... It is well known that bisimulation on µexpressions cannot be finitely axiomatised in equational logic. Complete axiomatisations such as those of Milner and Bloom/Ésik necessarily involve implicational rules. However, both systems rely on features which go beyond pure equational Horn logic: either t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
It is well known that bisimulation on µexpressions cannot be finitely axiomatised in equational logic. Complete axiomatisations such as those of Milner and Bloom/Ésik necessarily involve implicational rules. However, both systems rely on features which go beyond pure equational Horn logic: either
A Complete Axiomatisation for Trace Congruence of Finite State Behaviors
 Proceedings of Mathematical Foundations of Programming Semantics (IX), LNCS
, 1993
"... this paper trace congruence is considered. Trace congruence ignores branching structure and is close to language equivalence of classical automata theory. We provide a complete proof system for trace congruence over finite state behaviors presented as ¯expressions. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
this paper trace congruence is considered. Trace congruence ignores branching structure and is close to language equivalence of classical automata theory. We provide a complete proof system for trace congruence over finite state behaviors presented as ¯expressions.
Results 1  10
of
1,059