Compositionality and bisimulation: A negative result

DOI10.1016/0020-0190(91)90163-CzbMath0735.68057MaRDI QIDQ1182130

Gioia Ristori, Stefania Gnesi, Alessandro Fantechi

Publication date: 27 June 1992

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

zbMATH Keywords

compositionalitytemporal semanticstemporal logicsCCSbisimulation equivalenceCTL*full abstractnessreactive and concurrent systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items

Towards automatic temporal logic verification of value passing process algebra using abstract interpretation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof systems for satisfiability in Hennessy-Milner logic with recursion
• Characterizing finite Kripke structures in propositional temporal logic
• The temporal semantics of concurrent programs
• A calculus of communicating systems
• A logic for the description of non-deterministic programs and their properties
• “Sometimes” and “not never” revisited
• An action-based framework for veryfying logical and behavioural properties of concurrent systems

This page was built for publication: Compositionality and bisimulation: A negative result