scientific article; zbMATH DE number 3878352

MaRDI QIDQ3343432zbMATH OpenFDO

Authors Susanne Graf, Joseph Sifakis

Publication date 1984

zbMATH Keywords

calculus of communicating systemsCCSmodal logicobservational congruence

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Theory of operating systems (68N25) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• A modal characterization of observational congruence on finite terms of CCS
• scientific article; zbMATH DE number 3858386
• A proof-theoretic characterization of observational equivalence
• A complete axiomatisation for observational congruence of finite-state behaviours
• Modal logics for observation equivalences
• Deciding observational congruence of finite-state CCS expressions by rewriting
• An algebraic characterization of observational equivalence
• A logical characterization of observation equivalence
• On the complete axiomatization for prefix iteration modulo observation congruence
• scientific article; zbMATH DE number 3898213

Cited in

(15)

• A proof-theoretic characterization of observational equivalence
• Algebra of communicating processes with abstraction
• A logic for the specification and proof of regular controllable processes of CCS
• A context dependent equivalence between processes
• Characteristic invariants in Hennessy-Milner logic
• Logical characterisations, rule formats and compositionality for input-output conformance simulation
• scientific article; zbMATH DE number 3858386 (Why is no real title available?)
• A modal characterization of observational congruence on finite terms of CCS
• scientific article; zbMATH DE number 3995044 (Why is no real title available?)
• Modal logics for communicating systems
• Explainability of probabilistic bisimilarity distances for labelled Markov chains
• Deciding observational congruence of finite-state CCS expressions by rewriting
• A refinement calculus for specifications in Hennessy-Milner logic with recursion
• Proof systems for satisfiability in Hennessy-Milner logic with recursion
• A rewriting strategy to verify observational congruence

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3343432)