Complete sets of axioms for finite basic LOTOS behavioural equivalences

DOI10.1016/0020-0190(92)90008-JzbMath0753.68064WikidataQ114685335 ScholiaQ114685335MaRDI QIDQ1199556

Paola Inverardi, Michele Boreale, Monica Nesi

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

specification languagesbehavioural equivalencesconcurrencycomplete axiomatisation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60)

Uses Software

• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• A rewriting strategy to verify observational congruence
• Extensional equivalences for transition systems
• Testing equivalences for processes
• Algebraic laws for nondeterminism and concurrency

This page was built for publication: Complete sets of axioms for finite basic LOTOS behavioural equivalences