Characteristic formulae for fixed-point semantics: a general framework
DOI10.1017/S0960129511000375zbMATH Open1279.68181OpenAlexW2113617913MaRDI QIDQ2883115FDOQ2883115
Authors: Luca Aceto, Anna Ingolfsdottir, Paul Blain Levy, Joshua Sack 
Publication date: 11 May 2012
Published in: MSCS. Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129511000375
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
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Characterizing finite Kripke structures in propositional temporal logic
- Structured operational semantics and bisimulation as a congruence
- A lattice-theoretical fixpoint theorem and its applications
- Algebraic laws for nondeterminism and concurrency
- Bisimulation can't be traced
- Bisimulation through probabilistic testing
- Finite models constructed from canonical formulas
- From timed automata to logic -- and back
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Reactive Systems
- Results on the propositional \(\mu\)-calculus
- Formal verification of parallel programs
- Termination, deadlock, and divergence
- Branching time and abstraction in bisimulation semantics
- Three logics for branching bisimulation
- Graphical versus logical specifications
- A note on graded modal logic
- Characteristic formulae for timed autoamta
- Modal logics for communicating systems
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Modal correspondence for models
- A modal characterization of observational congruence on finite terms of CCS
- Characteristic formulae for processes with divergence
- A general approach to comparing infinite-state systems with their finite-state specifications
- Non-strongly stable orders also define interesting simulation relations
Cited In (16)
- A ghost at \(\omega_1\)
- The complexity of identifying characteristic formulae
- When are prime formulae characteristic?
- A coalgebraic view of characteristic formulas in equational modal fixed point logics
- Characterizations of the stable semantics by partial evaluation
- Semantic characterization of Kracht formulas
- Title not available (Why is that?)
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems
- On recursive operations over logic LTS
- Encoding safety in \(\mathrm{CLL}_R\)
- Characteristic formulae for relations with nested fixed points
- Removing redundant refusals: minimal complete test suites for failure trace semantics
- When are prime formulae characteristic?
- Logical characterisations, rule formats and compositionality for input-output conformance simulation
- Characteristic formulae for fixed-point semantics: a general framework
- A general framework for probabilistic characterizing formulae
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)
