Communicating sequential processes
Communicating sequential processes
Observation equivalence as a testing equivalence
Theoretical Computer Science
Theoretical Computer Science
Algebraic theory of processes
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term-rewriting systems with rule priorities
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Information and Computation
Process algebra
Separating concurrent languages with categories of language embeddings
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Structured operational semantics and bisimulation as a congruence
Information and Computation
Transition system specifications with negative premises
Theoretical Computer Science
Embedding as a tool for language comparison
Information and Computation
Turning SOS rules into equations
Information and Computation
The algebra of timed processes, ATP: theory and application
Information and Computation
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)
CPO models for compact GSOS languages
Information and Computation
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
An Equational Axiomatization of Observation Congruence for Prefix Iteration
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
On the Completeness of the Euations for the Kleene Star in Bisimulation
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Extending Process Languages with Time
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
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
Embeddings Among Concurrent Programming Languages (Preliminary Version)
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
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
An Overview and Synthesis on Timed Process Algebras
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Refusal Simulation and Interactive Games
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
A formalization of an Ordered Logical Framework in Hybrid with applications to continuation machines
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
A survey of semantic description frameworks for programming languages
ACM SIGPLAN Notices
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Modular Structural Operational Semantics with Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
A Congruence Rule Format with Universal Quantification
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic bisimulation as a congruence
ACM Transactions on Computational Logic (TOCL)
Generating priority rewrite systems for OSOS process languages
Information and Computation
Semantics and expressiveness of ordered SOS
Information and Computation
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
A constructive semantics for basic aspect constructs
Semantics and algebraic specification
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Probabilistic congruence for semistochastic generative processes
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
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 and uniform method for defining structural operational semantics (SOS) of process operators by traditional Plotkin-style transition rules equipped with orderings. This new feature allows one to control the order of application of rules when deriving transitions of process terms. Our method is powerful enough to deal with rules with negative premises and copying. We show that rules with orderings, called ordered SOS rules, have the same expressive power as GSOS rules. We identify several classes of process languages with operators defined by rules with and without orderings in the setting with silent actions and divergence. We prove that branching bisimulation and eager bisimulation relations are preserved by all operators in process languages in the relevant classes.