Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: van Glabbeek, Rob | Luttik, Bas | Trčka, Nikola
Affiliations: National ICT Australia, Sydney, Australia. School of Computer Science and Engineering, University of New South Wales, Sydney, Australia. [email protected] | Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, The Netherlands. CWI, The Netherlands. [email protected] | Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, The Netherlands. [email protected]
Note: [] Address for correspondence: Technische Universiteit Eindhoven, Department of Mathematics and Computer Science, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands
Abstract: We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original definition of branching bisimilarity with explicit divergence in terms of coloured traces. We also establish a correspondence with several variants of an action-based modal logic with until- and divergence modalities.
DOI: 10.3233/FI-2009-109
Journal: Fundamenta Informaticae, vol. 93, no. 4, pp. 371-392, 2009
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]