scientific article; zbMATH DE number 7136664

MaRDI QIDQ4972736zbMATH OpenFDO

Authors Bartek Klin, Mateusz Łełyk

Publication date 26 November 2019

Full work available at URL https://arxiv.org/abs/1803.06752

zbMATH Keywords

modal \(\mu\)-calculussets with atoms

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A calculus of atomic actions
• The vectorial \(\lambda\)-calculus
• Atomic operators in vector lattices
• A calculus for higher spin interactions
• Scalar potentials for vector fields in quantum electrodynamics
• Calcul symbolique de Dirac
• Atomistic simulations on scalar and vector computers
• Atomic decomposition of vector measures
• Atoms and Dobrakov submeasures in effect algebras
• Atomic systems in \(n\)-Hilbert spaces and their tensor products

Cites work

• scientific article; zbMATH DE number 1303726 (Why is no real title available?)
• scientific article; zbMATH DE number 1834677 (Why is no real title available?)
• A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus
• A new approach to abstract syntax with variable binding
• Alternating automata on data trees and XPath satisfiability
• Alternating register automata on finite words and trees
• An automata-theoretic approach to constraint LTL
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Automata theory in nominal sets
• Denotational semantics with nominal Scott domains
• Finite-memory automata
• Fresh-register automata
• Future-Looking Logics on Data Words and Trees
• LOIS: syntax and semantics
• LTL with the freeze quantifier and register automata
• Locally finite constraint satisfaction problems
• Modal logics and mu-calculi: An introduction
• Modal logics for nominal transition systems
• Model checking mobile processes
• Model-checking processes with data
• Multiple-Labelled Transition Systems for nominal calculi and their logics
• Nominal sets. Names and symmetry in computer science
• On the Bourbaki-Witt principle in toposes
• On the freeze quantifier in Constraint LTL: Decidability and complexity
• Reasoning about data repetitions with counter systems
• Results on the propositional \(\mu\)-calculus
• SMT solving for functional programming over infinite structures
• Symmetries, local names and dynamic (de)-allocation of names
• Temporal logics of repeating values
• Temporal logics with local constraints (invited talk)
• The mu-calculus and Model Checking
• Toward model theory with data values
• “Sometimes” and “not never” revisited

Cited in

(2)

• Church synthesis on register automata over linearly ordered data domains
• Modal \(\mu\)-calculus with atoms

Describes a project that uses

Uses Software

• LOIS
• NLambda

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972736)