Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
Structured operational semantics and bisimulation as a congruence
Information and Computation
A calculus of mobile processes, I
Information and Computation
Transition system specifications with negative premises
Theoretical Computer Science
Towards action-refinement in process algebras
Information and Computation
Turning SOS rules into equations
Information and Computation
Adding action refinement to a finite process algebra
Information and Computation
GSOS and finite labelled transition systems
Theoretical Computer Science
Journal of the ACM (JACM)
Comparing locality and causality based equivalences
Acta Informatica
Structural operational semantics for weak bisimulations
Theoretical Computer Science
Proving congruence of bisimulation in functional programming languages
Information and Computation
Ntyft/ntyxt rules reduce to ntree rules
Information and Computation
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
CPO models for compact GSOS languages
Information and Computation
A general conservative extension theorem in process algebras with inequalities
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Parameterized structured operational semantics
Fundamenta Informaticae
A conservative look at operational semantics with variable binding
Information and Computation
Enhanced operational semantics: a tool for describing and analyzing concurrent systems
ACM Computing Surveys (CSUR)
Communication and Concurrency
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Structured Operational Sematics for Process Algebras and Equational Axiom Systems
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Congruence Theorem for Structured Operational Semantics with Predicates
CONCUR '93 Proceedings of the 4th 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
The Meaning of Negative Premises in Transition System Specifications II
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Full Abstraction in Structural Operational Semantics (Extended Abstract)
AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
SOS for higher order processes
CONCUR 2005 - Concurrency Theory
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 5.23 |
This paper presents a new format for process algebras, the extended tyft/tyxt format which generalises the tyft/tyxt format of Groote and Vaandrager. The format differs from most previous formats in that the labels on transitions are treated as many-sorted terms. Bisimulation is a congruence for all operators defined by extended transition system specifications in this format.When one extended transition system specification is summed with another, the resulting bisimulation can either identify more terms (an abstracting extension up to bisimulation) or fewer terms (a refining extension up to bisimulation) than the original bisimulation on the individual system. The notions of abstracting extension and refining extension are defined, and two theorems are presented giving conditions required for achieving each type of extension. These results provide a way to compare different semantic equivalences defined for different process algebras.Finally, an application of this theory to semantic equivalence comparison is given for a new result relating Castellani's pomset equivalence and Krishan's multiprocessor equivalence.