On Context Bisimulation for Parameterized Higher-order Processes
Electronic Proceedings in Theoretical Computer Science2013Vol. 131, pp. 37–51
Citations Over TimeTop 20% of 2013 papers
Abstract
This paper studies context bisimulation for higher-order processes, in the presence of parameterization (viz. abstraction). We show that the extension of higher-order processes with process parameterization retains the characterization of context bisimulation by a much simpler form of bisimulation called normal bisimulation (viz. they are coincident), in which universal quantifiers are eliminated; whereas it is not the same with name parameterization. These results clarify further the bisimulation theory of higher-order processes, and also shed light on the essential distinction between the two kinds of parameterization.
Related Papers
- → Enhancements of the bisimulation proof method(2011)77 cited
- → Bisimulation for Higher-Order Process Calculi(1996)17 cited
- → Parameterized Counting Problems(2002)7 cited
- → On the parameterized complexity of approximate counting(2011)3 cited
- → Identification of Invariants of (Over)Parameterized Models(2012)