Characteristic formulae for fixed-point semantics: a general framework
From MaRDI portal
Publication:2883115
Recommendations
- Characteristic formulae for fixed-point semantics: a general framework
- A general framework for probabilistic characterizing formulae
- Characteristic formulae for relations with nested fixed points
- A coalgebraic view of characteristic formulas in equational modal fixed point logics
- Characteristic formulae for processes with divergence
Cites work
- A general approach to comparing infinite-state systems with their finite-state specifications
- A lattice-theoretical fixpoint theorem and its applications
- A modal characterization of observational congruence on finite terms of CCS
- A note on graded modal logic
- Algebraic laws for nondeterminism and concurrency
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Bisimulation can't be traced
- Bisimulation through probabilistic testing
- Branching time and abstraction in bisimulation semantics
- Characteristic formulae for processes with divergence
- Characteristic formulae for timed autoamta
- Characterizing finite Kripke structures in propositional temporal logic
- Finite models constructed from canonical formulas
- Formal verification of parallel programs
- From timed automata to logic -- and back
- Graphical versus logical specifications
- Modal correspondence for models
- Modal logics for communicating systems
- Non-strongly stable orders also define interesting simulation relations
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Reactive Systems
- Results on the propositional \(\mu\)-calculus
- Structured operational semantics and bisimulation as a congruence
- Termination, deadlock, and divergence
- Three logics for branching bisimulation
Cited in
(16)- A ghost at \(\omega_1\)
- Characteristic formulae for fixed-point semantics: a general framework
- A coalgebraic view of characteristic formulas in equational modal fixed point logics
- On recursive operations over logic LTS
- Characterizations of the stable semantics by partial evaluation
- When are prime formulae characteristic?
- Characteristic formulae for relations with nested fixed points
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems
- Removing redundant refusals: minimal complete test suites for failure trace semantics
- Encoding safety in \(\mathrm{CLL}_R\)
- A general framework for probabilistic characterizing formulae
- The complexity of identifying characteristic formulae
- When are prime formulae characteristic?
- Logical characterisations, rule formats and compositionality for input-output conformance simulation
- Semantic characterization of Kracht formulas
- scientific article; zbMATH DE number 7023675 (Why is no real title available?)
This page was built for publication: Characteristic formulae for fixed-point semantics: a general framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883115)
