Characteristic formulae for fixed-point semantics: a general framework (Q2883115): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Proof systems for satisfiability in Hennessy-Milner logic with recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal correspondence for models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic Formulae for Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach to comparing infinite-state systems with their finite-state specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination, deadlock, and divergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic laws for nondeterminism and concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured operational semantics and bisimulation as a congruence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modal characterization of observational congruence on finite terms of CCS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching time and abstraction in bisimulation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-strongly Stable Orders Also Define Interesting Simulation Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal logics for communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic formulae for processes with divergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on graded modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three logics for branching bisimulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite models constructed from canonical formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing finite Kripke structures in propositional temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical versus logical specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation can't be traced / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: From timed automata to logic — and back / rank
 
Normal rank

Revision as of 05:12, 5 July 2024

scientific article
Language Label Description Also known as
English
Characteristic formulae for fixed-point semantics: a general framework
scientific article

    Statements

    Characteristic formulae for fixed-point semantics: a general framework (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    0 references

    Identifiers