On Finite Bases for Weak Semantics: Failures Versus Impossible Futures

Authors:
Taolue Chen;Wan Fokkink;Rob Glabbeek
Affiliations:
CWI, Department of Software Engineering, Amsterdam, The Netherlands 1090 GB;CWI, Department of Software Engineering, Amsterdam, The Netherlands 1090 GB and Department of Theoretical Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands 1081 HV;National ICT Australia, Sydney, Australia NSW 1466 and School of Computer Science and Engineering, The University of New South Wales, Sydney, Australia NSW 2052
Venue:
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Year:
2009

Citing 18
Cited 0

A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)
Algebraic theory of processes

Algebraic theory of processes
A complete axiomatisation for observational congruence of finite-state behaviours

Information and Computation
A new strategy for proving &ohgr;-completeness applied to process algebra

CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Notes on the methodology of CCS and CSP

ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Impossible futures and determinism

Information Processing Letters
Modular Construction and Partial Order Semantics of Petri Nets

Modular Construction and Partial Order Semantics of Petri Nets
A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
The Linear Time - Branching Time Spectrum II

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Nested semantics over finite trees are equationally hard

Information and Computation
Fair testing

Information and Computation
On finite alphabets and infinite bases

Information and Computation
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Possible futures, acceptances, refusals, and communicating processes

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Ready to preorder: The case of weak process semantics

Information Processing Letters
Ready to preorder: get your BCCSP axiomatization for free!

CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
A finite basis for failure semantics

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Liveness, fairness and impossible futures

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results regarding the axiomatizability of BCCS modulo weak impossible futures semantics.