scientific article; zbMATH DE number 3688686

Cited in

(95)

A complete inference system for a class of regular behaviours
A proof-theoretic characterization of observational equivalence
On powerdomains and modality
Merging regular processes by means of fixed-point theory
About fair asynchrony
A context dependent equivalence between processes
Characterizing finite Kripke structures in propositional temporal logic
Partial abstract types
Experimenting with process equivalence
Synchronization trees
Testing equivalences for processes
Trees and semantics
Undecidable problems in unreliable computations.
Mathematical modal logic: A view of its evolution
A formalized general theory of syntax with bindings
Using coalgebras and the Giry monad for interpreting game logics -- a tutorial
Second-order propositional modal logic: expressiveness and completeness results
A brief history of process algebra
A formalized general theory of syntax with bindings: extended version
A logical and graphical framework for reaction systems
A game for linear-time-branching-time spectroscopy
A process algebraic approach to reaction systems
Saturated Kripke structures as Vietoris coalgebras
Bisimulation for Feller-Dynkin processes
Trust evidence logic
Characteristic invariants in Hennessy-Milner logic
Strategies, model checking and branching-time properties in Maude
Expressiveness of probabilistic modal logics: a gradual approach
A description based on languages of the final non-deterministic automaton
A modal proof theory for final polynomial coalgebras
Final coalgebras and the Hennessy-Milner property
Modelling and analysing neural networks using a hybrid process algebra
Many-sorted coalgebraic modal logic: A model-theoretic study
Semi-decidability of may, must and probabilistic testing in a higher-type setting
Branching bisimulation games
Bounded situation calculus action theories
A logic of separating modalities
Deciding the bisimilarity relation between Datalog goals
Two-Variable Separation Logic and Its Inner Circle
Full abstraction at package boundaries of object-oriented languages
Lost in Translation: Hybrid-Time Flows vs. Real-Time Transitions
Solving μ-Calculus Parity Games by Symbolic Planning
Lattice properties of congruences for stochastic relations
Program equivalence in a simple language with state
Separation logics and modalities: a survey
PLQP \& Company: decidable logics for quantum algorithms
(Metric) bisimulation games and real-valued modal logics for coalgebras
Trace equivalence and epistemic logic to express security properties
Rough approximations based on bisimulations
Relating structure and power: comonadic semantics for computational resources
Trace analysis using an event-driven interval temporal logic
Bisimilarity of Diagrams
Deciding all behavioral equivalences at once: a game for linear-time-branching-time spectroscopy
Synchronous message passing: on the relation between bisimulation and refusal equivalence
Verifying optimizations for concurrent programs
A linear translation from CTL^* to the first-order modal -calculus
Expressive logics for coalgebras via terminal sequence induction
Refusal testing
Observation equivalence as a testing equivalence
Modal logics for nominal transition systems
Characteristic formulae for liveness properties of non-terminating CakeML programs
On Composing Finite Forests with Modal Logics
From modal logic to terminal coalgebras
On implementations and semantics of a concurrent programming language
Explainability of probabilistic bisimilarity distances for labelled Markov chains
Arboreal categories and equi-resource homomorphism preservation theorems
Can we communicate? Using dynamic logic to verify team automata
Process equivalence problems as energy games
Modal and temporal logics for processes
A probabilistic modal logic for context-aware trust based on evidence
Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers
Characterizing contrasimilarity through games, modal logic, and complexity
A categorical approach to coalgebraic fixpoint logic
Graded semantics and graded logics for Eilenberg-Moore coalgebras
A categorical account of composition methods in logic
Approximate bisimulations for Kripke models of fuzzy multimodal logics over complete Heyting algebras
Non finite axiomatisability of weak bisimulation-based congruences
On algorithms verifying initial-and-final-state opacity: complexity, special cases, and comparison
The B2Scala tool: integrating Bach in Scala with security in mind
Computing minimal distinguishing Hennessy-Milner formulas is NP-hard, but variants are tractable
Axiomatising weak bisimulation congruences over CCS with left merge and communication merge
Approximate Hennessy-Milner type theorems for fuzzy multimodal logics over Heyting algebras
Minimal depth distinguishing formulas without until for branching bisimulation
Encapsulating deontic and branching time specifications
Existential and positive games: a comonadic and axiomatic view
From bisimulation to traces: the impact of parallel composition on finite bases
Explainability is a game for probabilistic bisimilarity distances
The Weak Spectroscopy Game to Characterize Behavioral Equivalences
Algèbre de processus et synchronisation
A fair calculus of communicating systems
A logical characterization of observation equivalence
A calculus and logic of bunched resources and processes
Reasoning about networks with many identical finite state processes
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Kleisli morphisms and randomized congruences for the Giry monad

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 Q3883467)