Observational structures and their logic
Selected papers of the Second Workshop on Concurrency and compositionality
Structured operational semantics and bisimulation as a congruence
Information and Computation
Transition system specifications with negative premises
Theoretical Computer Science
Journal of the ACM (JACM)
Comparing locality and causality based equivalences
Acta Informatica
Ntyft/ntyxt rules reduce to ntree rules
Information and Computation
Parameterized structured operational semantics
Fundamenta Informaticae
Communication and Concurrency
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
A Congruence Theorem for Structured Operational Semantics with Predicates
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A General Conservative Extension Theorem in Process Algebra
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
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
| Hi-index | 0.00 |
This research defines a new format called extended tyft/tyxt format. This format is able to express process algebras with structured or non-atomic labels and their bisimulation-based semantic equivalences. A general notion of bisimulation is a congruence for this format, under reasonable technical conditions. The aim of this format is to allow the comparison of bisimulation-based semantic equivalences and to this end, this paper defines a number of extensions and gives results showing conditions required to achieve the extensions. This paper also discusses the process algebras that can be expressed in this format and presents a new semantic equivalence comparison result for multiprocessor bisimulation and pomset bisimulation.