A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Term-rewriting systems with rule priorities
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Process algebra
Structured operational semantics and bisimulation as a congruence
Information and Computation
Handbook of logic in computer science (vol. 2)
Turning SOS rules into equations
Information and Computation
The algebra of timed processes, ATP: theory and application
Information and Computation
Structured operational semantics as a specification language
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of the ACM (JACM)
A process algebra for timed systems
Information and Computation
Using a Protean Language to Enhance Expressiveness in Specification
IEEE Transactions on Software Engineering
Operational semantics of rewriting with priorities
Theoretical Computer Science
Term rewriting and all that
Semantics and strong sequentiality of priority term rewriting systems
Theoretical Computer Science - Special issue on rewriting techniques and applications
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Finite axiom systems for testing preorder and De Simone process languages
Theoretical Computer Science
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Ordered SOS process languages for branching and Eager bisimulation
Information and Computation
Term Rewriting Properties of SOS Axiomatisations
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours
CONCUR '94 Proceedings of the Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Termination of Associative-Commutative Rewriting by Dependency Pairs
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting
Fundamenta Informaticae
| Hi-index | 0.00 |
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisimulation and head normalising. The algorithm is inspired by a procedure which was developed by Aceto, Bloom and Vaandrager and presented in Turning SOS rules into equations [L. Aceto, B. Bloom, F.W. Vaandrager, Turning SOS rules into equations, Information and Computation 111 (1994) 1-52]. For a subclass of OSOS process languages representing finite behaviours the PRSs that are generated by our algorithm are strongly normalising (terminating) and confluent, where termination is proved using the dependency pair and dependency graph techniques. Additionally, such PRSs are complete for bisimulation on closed process terms modulo associativity and commutativity of the choice operator of CCS. We illustrate the usefulness of our results, and the benefits of rewriting with priorities in general, with several examples.