Observation equivalence as a testing equivalence
Theoretical Computer Science
Algebraic theory of processes
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
Process algebra
Transition system specifications with negative premises
Theoretical Computer Science
Turning SOS rules into equations
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
Structural operational semantics for weak bisimulations
Theoretical Computer Science
Axiomatizing prefix iteration with silent steps
Information and Computation
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Rooted branching bisimulation as a congruence
Journal of Computer and System Sciences
Finite axiom systems for testing preorder and De Simone process languages
Theoretical Computer Science
Communication and Concurrency
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
Extending Process Languages with Time
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
CPO Models for a Class of GSOS Languages
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Formats of Ordered SOS Rules with Silent Actions
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Refusal Simulation and Interactive Games
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
On cool congruence formats for weak bisimulations
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
We present a general class of process languages for rooted eager bisimulation preorder and prove its congruence result. Also, we present classes of process languages for the rooted versions of several other weak preorders. The process languages we propose are defined by the Ordered SOS method which combines the traditional SOS approach, based on transition rules, with the ordering on transition rules. This new feature specifies the order of application of rules when deriving transitions of process terms. We support and illustrate our results with examples of process operators and process languages which benefit from the OSOS formulation.