Proof systems for satisfiability in Hennessy-Milner Logic with recursion
- 23 May 1990
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 72 (2-3), 265-288
- https://doi.org/10.1016/0304-3975(90)90038-j
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Modal logics for communicating systemsTheoretical Computer Science, 1987
- A logic for the specification and proof of regular controllable processes of CCSActa Informatica, 1986
- A logic for the description of non-deterministic programs and their propertiesInformation and Control, 1986
- A proof-theoretic characterization of observational equivalenceTheoretical Computer Science, 1985
- A logical characterization of observation equivalenceTheoretical Computer Science, 1985
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- The temporal logic of branching timeActa Informatica, 1983
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955