Communicating sequential processes
Communicating sequential processes
Observation equivalence as a testing equivalence
Theoretical Computer Science
Theoretical Computer Science
Communication and concurrency
Process algebra
Bisimulation through probabilistic testing
Information and Computation
Transition system specifications with negative premises
Theoretical Computer Science
Journal of the ACM (JACM)
Structural operational semantics for weak bisimulations
Theoretical Computer Science
Axiomatizing prefix iteration with silent steps
Information and Computation
Finite axiom systems for testing preorder and De Simone process languages
Theoretical Computer Science
Modal and temporal properties of processes
Modal and temporal properties of processes
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Ordered SOS process languages for branching and Eager bisimulation
Information and Computation
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
Process Languages for Rooted Eager Bisimulation
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Ready simulation for concurrency: It's logical!
Information and Computation
Axiomatizing weak ready simulation semantics over BCCSP
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
| Hi-index | 0.00 |
We present refusal simulation relation as a candidate for the finest branching time relation that is solely based on all locally observable and testable properties of processes, and no other properties. Apart from several known characterisations, we introduce a new one in terms of interactive games. Two general formats of transition rules, based on the new Ordered Structural Operational Semantics approach [20], are given such that refusal simulation and its rooted version are preserved in arbitrary process languages definable within the respective formats.