scientific article; zbMATH DE number 7136664
From MaRDI portal
Publication:4972736
zbMATH Open1442.68108arXiv1803.06752MaRDI QIDQ4972736FDOQ4972736
Authors: Bartek Klin, Mateusz Łełyk 
Publication date: 26 November 2019
Full work available at URL: https://arxiv.org/abs/1803.06752
Title of this publication is not available (Why is that?)
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
Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Modal logics and mu-calculi: An introduction
- Nominal sets. Names and symmetry in computer science
- A new approach to abstract syntax with variable binding
- An automata-theoretic approach to constraint LTL
- LTL with the freeze quantifier and register automata
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Results on the propositional \(\mu\)-calculus
- “Sometimes” and “not never” revisited
- Finite-memory automata
- Alternating register automata on finite words and trees
- Title not available (Why is that?)
- Reasoning about data repetitions with counter systems
- Fresh-register automata
- Automata theory in nominal sets
- Model-checking processes with data
- Title not available (Why is that?)
- A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus
- Symmetries, local names and dynamic (de)-allocation of names
- Temporal logics of repeating values
- Alternating automata on data trees and XPath satisfiability
- The mu-calculus and Model Checking
- On the freeze quantifier in Constraint LTL: Decidability and complexity
- Model checking mobile processes
- Modal logics for nominal transition systems
- Toward model theory with data values
- Future-Looking Logics on Data Words and Trees
- On the Bourbaki-Witt principle in toposes
- SMT solving for functional programming over infinite structures
- LOIS: syntax and semantics
- Temporal logics with local constraints (invited talk)
- Denotational semantics with nominal Scott domains
- Locally finite constraint satisfaction problems
- Multiple-Labelled Transition Systems for nominal calculi and their logics
Cited In (2)
Uses Software
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)
