scientific article
From MaRDI portal
Publication:3883467
zbMath0441.68018MaRDI QIDQ3883467
Arthur J. Milner, Matthew C. B. Hennessy
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Related Items (75)
Modelling and analysing neural networks using a hybrid process algebra ⋮ On Composing Finite Forests with Modal Logics ⋮ Merging regular processes by means of fixed-point theory ⋮ Trace Equivalence and Epistemic Logic to Express Security Properties ⋮ Bounded situation calculus action theories ⋮ About fair asynchrony ⋮ A logic of separating modalities ⋮ Bisimulation for Feller-Dynkin processes ⋮ A context dependent equivalence between processes ⋮ Synchronization trees ⋮ Testing equivalences for processes ⋮ Trust evidence logic ⋮ Deciding the Bisimilarity Relation between Datalog Goals ⋮ Characterizing finite Kripke structures in propositional temporal logic ⋮ Unnamed Item ⋮ Characteristic invariants in Hennessy-Milner logic ⋮ Separation logics and modalities: a survey ⋮ Trace Analysis Using an Event-Driven Interval Temporal Logic ⋮ Bisimilarity of Diagrams ⋮ Trees and semantics ⋮ Expressiveness of probabilistic modal logics: a gradual approach ⋮ On implementations and semantics of a concurrent programming language ⋮ A formalized general theory of syntax with bindings ⋮ Explainability of probabilistic bisimilarity distances for labelled Markov chains ⋮ Two-Variable Separation Logic and Its Inner Circle ⋮ Undecidable problems in unreliable computations. ⋮ Arboreal categories and equi-resource homomorphism preservation theorems ⋮ Can we communicate? Using dynamic logic to verify team automata ⋮ Lattice properties of congruences for stochastic relations ⋮ A calculus and logic of bunched resources and processes ⋮ Lost in Translation: Hybrid-Time Flows vs. Real-Time Transitions ⋮ Using coalgebras and the Giry monad for interpreting game logics -- a tutorial ⋮ Mathematical modal logic: A view of its evolution ⋮ Program equivalence in a simple language with state ⋮ Verifying Optimizations for Concurrent Programs ⋮ Reasoning about networks with many identical finite state processes ⋮ Partial abstract types ⋮ A description based on languages of the final non-deterministic automaton ⋮ PLQP \& Company: decidable logics for quantum algorithms ⋮ Second-order propositional modal logic: expressiveness and completeness results ⋮ Characteristic formulae for liveness properties of non-terminating CakeML programs ⋮ (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras ⋮ A formalized general theory of syntax with bindings: extended version ⋮ Strategies, model checking and branching-time properties in Maude ⋮ Rough approximations based on bisimulations ⋮ Experimenting with process equivalence ⋮ Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study ⋮ A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus ⋮ From modal logic to terminal coalgebras ⋮ Expressive logics for coalgebras via terminal sequence induction ⋮ Synchronous Message Passing: On the Relation between Bisimulation and Refusal Equivalence ⋮ Encapsulating deontic and branching time specifications ⋮ A brief history of process algebra ⋮ On the complexity of checking semantic equivalences between pushdown processes and finite-state processes ⋮ Refusal testing ⋮ Observation equivalence as a testing equivalence ⋮ A modal proof theory for final polynomial coalgebras ⋮ Kleisli morphisms and randomized congruences for the Giry monad ⋮ A logical and graphical framework for reaction systems ⋮ Unnamed Item ⋮ Solving μ-Calculus Parity Games by Symbolic Planning ⋮ Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting ⋮ A game for linear-time-branching-time spectroscopy ⋮ A process algebraic approach to reaction systems ⋮ Relating Structure and Power: Comonadic Semantics for Computational Resources ⋮ Branching Bisimulation Games ⋮ Full Abstraction at Package Boundaries of Object-Oriented Languages ⋮ Algèbre de processus et synchronisation ⋮ A fair calculus of communicating systems ⋮ A complete inference system for a class of regular behaviours ⋮ Final coalgebras and the Hennessy-Milner property ⋮ A proof-theoretic characterization of observational equivalence ⋮ A logical characterization of observation equivalence ⋮ Saturated Kripke structures as Vietoris coalgebras ⋮ On powerdomains and modality
This page was built for publication:
