Corradini, Flavio; De Nicola, Rocco; Labella, Anna Graded modalities and resource bisimulation. (English) Zbl 0948.03024 Pandu Rangan, C. (ed.) et al., Foundations of software technology and theoretical computer science. 19th conference, Chennai, India, December 13-15, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1738, 381-393 (1999). Summary: The logical characterization of the strong and the weak (ignoring silent actions) versions of resource bisimulation are studied. The temporal logics we introduce are variants of Hennessy-Milner logics that use graded modalities instead of the classical box and diamond operators. The considered strong bisimulation induces an equivalence that, when applied to labelled transition systems, permits identifying all and only those systems that give rise to isomorphic unfoldings. Strong resource bisimulation has been used to provide nondeterministic interpretation of finite regular expressions and new axiomatizations for them. Here we generalize this result to its weak variant.For the entire collection see [Zbl 0931.00044]. Cited in 4 Documents MSC: 03B70 Logic in computer science 68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) 03B44 Temporal logic 03B45 Modal logic (including the logic of norms) Keywords:resource bisimulation; temporal logics; graded modalities PDFBibTeX XMLCite \textit{F. Corradini} et al., Lect. Notes Comput. Sci. 1738, 381--393 (1999; Zbl 0948.03024)