Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Three partition refinement algorithms
SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Structured operational semantics and bisimulation as a congruence
Information and Computation
Journal of the ACM (JACM)
Communication and Concurrency
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Nested semantics over finite trees are equationally hard
Information and Computation
Theoretical Computer Science - Selected papers of CMCS'03
Bisimulations up-to for the linear time branching time spectrum
CONCUR 2005 - Concurrency Theory
New Bisimulation Semantics for Distributed Systems
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Hi-index | 0.01 |
Nested simulations define an interesting hierarchy of semantic preorders and equivalences in which every semantics refines the previous one and it is refined by the following. This nested nature provides a fruitful framework for the study of the formal meaning and the properties of concurrent processes. In this paper we present the notion of constrained simulation that, although rather simple, allows us to find general results for a wide family of semantics. In particular, we provide an axiomatization for both the preorder and the equivalence induced by any constrained simulation. Nested simulations are constrained simulations and therefore our results can be instantiated directly to them. Besides, constrained simulations suggest the definition of a new family of semantics, generalised nested simulation semantics, constructed over the base of any order relation, instead of plain simulation. Finally, we conclude the study of the (generalised) nested semantics defining a generalisation of bisimulation relations, counting bisimulation, that allows us to define a characterisation of nested semantics in terms of a bisimulation-like game.