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: De Frutos Escrig, Davida | Indermark, Klausb
Affiliations: [a] Dpto. Informática y Automática, Fac. C. Matemáticas, Universidad Complutense, 28040 Madrid, Spain | [b] Lehrstuhl für Informatik II, RWTH Aachen, Ahornstrasse 55, 5100 Aachen, F.R.G.
Abstract: We consider three different meanings of a non-deterministic Ianov-scheme with respect to infinite computations: trace-semantics, Plotkin-semantics, and Smyth-semantics. The corresponding equivalence relations are shown to be decidable.
Keywords: Program schemes, non-determinism, equivalence relations, decidability
DOI: 10.3233/FI-1989-12303
Journal: Fundamenta Informaticae, vol. 12, no. 3, pp. 289-315, 1989
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]