A modal characterization of observational congruence on finite terms of CCS

DOI10.1016/S0019-9958(86)80031-6zbMath0591.68031MaRDI QIDQ3719814

Susanne Graf, Joseph Sifakis

Publication date: 1986

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

translationCCSobservational congruencemodal language

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

Characteristic formulae for fixed-point semantics: a general framework, Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS, When Are Prime Formulae Characteristic?, Characteristic invariants in Hennessy-Milner logic, When are prime formulae characteristic?, A model of actors and grey failures, Removing redundant refusals: minimal complete test suites for failure trace semantics, Local model checking in the modal mu-calculus, Characteristic Formulae for Timed Automata, The complexity of identifying characteristic formulae, Event Identifier Logic, Logical characterization of branching metrics for nondeterministic probabilistic transition systems, Connection between logical and algebraic approaches to concurrent systems, Predicate liftings and functor presentations in coalgebraic expression languages, Encoding safety in \(\mathrm{CLL}_R\), Reasoning about nondeterministic and concurrent actions: A process algebra approach, Inductive synthesis of recursive processes from logical properties