Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Three partition refinement algorithms
SIAM Journal on Computing
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Priorities in process algebras
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
A resource-based prioritized bisimulation for real-time systems
Information and Computation
Information and Computation
A process algebra with distributed priorities
Theoretical Computer Science
Communication and Concurrency
A practical approach to implementing real-time semantics
Annals of Software Engineering
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
The Meaning of Negative Premises in Transition System Specifications
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
An Algebraic Theory of Multiple Clocks
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Translating Timed Process Algebra into Prioritized Process Algebra
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Priority and Abstraction in Process Algebra
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Bisimulation on speed: worst-case efficiency
Information and Computation
On the axiomatizability of priority
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Bisimilarity is not finitely based over BPA with interrupt
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Testing techniques in software engineering
Testing techniques in software engineering
Algebraic program semantics for supercomputing
Theories of Programming and Formal Methods
Under-approximation of Reachability in Multivalued Asynchronous Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
More than 15 years ago, Cleaveland and Hennessy proposed an extension of the process algebra CCS in which some actions may take priority over others. The theory was equipped with a behavioral congruence based on strong bisimulation. This article gives a full account of the challenges in, and the solutions employed for, defining a semantic theory of observation congruence for this process algebra. A full-abstraction result is presented whose proof relies on a novel approach based on successive approximations for identifying the largest congruence contained in an intuitive but naive equivalence. Prioritized observation congruence is also characterized equationally for the class of finite processes, while its utility for system verification is demonstrated by an illustrative example.