A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Decidable Extensions of Hennessy-Milner Logic
[chapter]

2006
*
Lecture Notes in Computer Science
*

They have been designed as

doi:10.1007/11888116_16
fatcat:dpvcdxebejfddmxcxctlzo6mzi
*extensions**of**Hennessy*-*Milner**logic*with spatial operators (inspired by Cardelli-Gordon-Caires spatial*logic*) and epistemic operators (inspired by dynamic-epistemic*logics*). ... We propose a new class*of**logics*for specifying and modelchecking properties*of*distributed systems -Dynamic Epistemic Spatial*Logics*. ... We thank to Alexandru Baltag for contributing with valuable comments, since the beginning, on the construction*of*this*logic*. Thanks also to Luca Cardelli for comments and related discussions. ...##
###
Expressivity in chain-based modal logics

2017
*
Archive for Mathematical Logic
*

Necessary and sufficient algebraic conditions for admitting a suitable

doi:10.1007/s00153-017-0573-4
fatcat:jka36m7inrderhufanyyc2rm2e
*Hennessy*-*Milner*property are established for classes*of*image-finite and (appropriately defined) modally saturated models. ... We investigate the expressivity*of*many-valued modal*logics*based on an algebraic structure with a complete linearly ordered lattice reduct. ... ,*decidability*, and complexity. ...##
###
Rank-1 Modal Logics are Coalgebraic

2008
*
Journal of Logic and Computation
*

Coalgebras provide a unifying semantic framework for a wide variety

doi:10.1093/logcom/exn096
fatcat:bbfaxbe5bbhzzigg7joigvuqzu
*of*modal*logics*. It has previously been shown that the class*of*coalgebras for an endofunctor can always be axiomatised in rank 1. ... their semantic status; we thus obtain purely syntactic versions*of*these results. ...*Hennessy*-*Milner**logic*, graded modal*logic*[4] , majority*logic*[13] , probabilistic modal*logic*[12, 7] , and coalition*logic*[16] , but also modal operators*of*higher arity as e.g. in conditional ...##
###
Basic Model Theory for Memory Logics
[chapter]

2011
*
Lecture Notes in Computer Science
*

Memory

doi:10.1007/978-3-642-20920-8_8
fatcat:wlurlipxzbfc7goti75cfwa4ju
*logics*is a family*of*modal*logics*whose semantics is specified in terms*of*relational models enriched with additional data structure to represent a memory. ... The*logical*language includes a collection*of*operations to access and modify the data structure. ... This*extension*is created by taking an ultrapower*of*the model with a special kind*of*ultrafilter. 3 We now prove that, for every memory*logic*L, the class*of*ω-saturated models has the*Hennessy*-*Milner*...##
###
Mobile Processes: A Commented Bibliography
[chapter]

2001
*
Lecture Notes in Computer Science
*

as modelled in the π-calculus

doi:10.1007/3-540-45510-8_11
fatcat:ksp2ci37rbc5jbwokvcs2ugspq
*of**Milner*, Parrow and Walker for example, and motile processes, which can exhibit motion, as modelled in the ambient calculus*of*Cardelli and Gordon. ... A common characteristic*of*the algebraic frameworks presented in this paper is the use*of*names as first class values and the support for the dynamic generation*of*new, fresh names. ... Luca Cardelli and Andy Gordon commented on a previous version*of*this text. ...##
###
Reachability of Hennessy-Milner Properties for Weakly Extended PRS
[chapter]

2005
*
Lecture Notes in Computer Science
*

We examine the problem whether a given weakly extended process rewrite system (wPRS) contains a reachable state satisfying a given formula

doi:10.1007/11590156_17
fatcat:rejc2vclcveshp6idkhh67tg6y
*of**Hennessy*-*Milner**logic*. ... We show that this problem is*decidable*. As a corollary we observe that the problem*of*strong bisimilarity between wPRS and finite-state systems is*decidable*. ... If we consider the reachability HM property problem, i.e. the reachability property problem where ϕ is a formula*of**Hennessy*-*Milner**logic*(HM formula), then this problem has been shown to be*decidable*...##
###
Computing distinguishing formulas for branching bisimulation
[chapter]

1992
*
Lecture Notes in Computer Science
*

This paper presents an algorithm which, given two branching bisimulation inequivalent finite state processes, produces a distinguishing formula in

doi:10.1007/3-540-55179-4_3
fatcat:tt65qstqkfbrxlluo743gqqkum
*Hennessy*-*Milner**logic*extended with an 'until' operator ... Our algorithm provides a useful*extension*to the algorithm for*deciding*equivalence because it tells a user why certain finite state systems are inequivalent. ... Special thanks to Jan Friso Groote for reading the previous draft*of*this paper very carefully. ...##
###
Decidability and Expressiveness of Recursive Weighted Logic
[chapter]

2015
*
Lecture Notes in Computer Science
*

In addition, we prove that the

doi:10.1007/978-3-662-46823-4_18
fatcat:vd4pzndkonfwnb4jklfsyr4zwy
*logic*is*decidable*, i.e., the satisfiability problem for RWL can be algorithmically solved. ... Recursive Weighted*Logic*(RWL) is a multimodal*logic*that expresses qualitative and quantitative properties*of*LWSs. ... and semantics; Section 4 is dedicated to the*Hennessy*-*Milner*property*of*RWL; in Section 5 we prove the*decidability**of*the satisfiability problem for RWL and we propose an algorithm to solve it. ...##
###
Page 4083 of Mathematical Reviews Vol. , Issue 2004e
[page]

2004
*
Mathematical Reviews
*

Sci. 59 (1988), no. 1-2, 115- 131; MR 89k:03030], where a kind

*of**Hennessy*-*Milner*theorem is shown for CTL* on finite Kripke structures [cf. M. C. B.*Hennessy*and R.*Milner*, J. Assoc. Comput. ... In this paper, we present a meta-*logic*that can be 68Q Theory*of*computing 2004e:68068 used to reason about judgments coded using HOAS; this meta-*logic*is an*extension**of*a simple intuitionistic*logic*...##
###
Proof systems for satisfiability in Hennessy-Milner Logic with recursion

1990
*
Theoretical Computer Science
*

An

doi:10.1016/0304-3975(90)90038-j
fatcat:rcub7xi6mncndiv7y4vilennui
*extension**of**Hennessy*-*Milner**Logic*with recursion is presented. A recursively specified formula will have two standard interpretations: a minimal one and d rnasirnal one. ... The rules*of*the proof systems consist*of*an introduction rule for each possible structure*of*a formula and are intended to extend the work*of*Stirling and Winskel. ... So far, not even small systems have been dealt with using*Hennessy*-*Milner**Logic*. ...##
###
Contents and abstracts of the electronic notes in Theoretical Computer Science Vol. 5

1998
*
Theoretical Computer Science
*

Monica Nesi
Mechanising a modal

doi:10.1016/s0304-3975(97)00248-x
fatcat:sdn5br4hkvhjnowkexgso4rute
*logic*for value>passing agents in HOL http://wwu.elsevier.nl/locate/entcs/volume5.html An*extension**of**Hennessy*-*Milner**logic*to value-passing CCS is embedded in the HOL ... concurrent*extension**of*the MLfunctional language equipped with message-passing inter-process communication along first-class channels. ... Soundness*of*the proof system is established.The use*of*the system is demonstrated on two small but instructive examples. ...##
###
Logics for Bisimulation and Divergence
[chapter]

2018
*
Lecture Notes in Computer Science
*

The study

doi:10.1007/978-3-319-89366-2_12
fatcat:xaqvn53qyvdpvecuyssb2srrsq
*of*modal*logics*and various bisimulation equivalences so far shows the following progression: 1. weak bisimilarity is characterized by*Hennessy*-*Milner**logic*(HML), a simple propositional modal ... As main results*of*the paper, the*logic*in A. provides a modal characterization for complete weak bisimilarity, and moreover the two new*logics*in A. and B. are both sub-*logics**of*the known*logic*obtained ... One is another*extension**of**Hennessy*-*Milner**logic*which exploits the power*of*backward modalities. ...##
###
Bisimulation through probabilistic testing

1991
*
Information and Computation
*

We propose a language for testing concurrent processes and examine its strength in terms

doi:10.1016/0890-5401(91)90030-6
fatcat:lmege423szdpzotgkb5k7b7d64
*of*the processes that are distinguished by a test. ... We also show a similar result (in a slightly stronger form) for a new process relation called $-bisimulation-which lies strictly between that*of*simulation and bisimulation. ... ACKNOWLEDGMENTS This work-owing inspiration to the framework*of*Samson Abramsky (1987)-has been carried out as part*of*the TAU-project, a project supported by the FTU-program under the Danish Research ...##
###
Synthesizing distinguishing formulae for real time systems -extended abstract
[chapter]

1995
*
Lecture Notes in Computer Science
*

The formulas

doi:10.1007/3-540-60246-1_157
fatcat:xafo72sxynctfkzq7ensb3i2wu
*of**Hennessy*{*Milner**Logic*, M, are given by the following abstract syntax: F ::= tt j F^G j :F j h iF We interpret*Hennessy*{*Milner**Logic*relative to the labelled transition system N n . ... The well known*Hennessy*{*Milner**Logic*11] provides the key to such explanations. ...##
###
Page 5016 of Mathematical Reviews Vol. , Issue 96h
[page]

1996
*
Mathematical Reviews
*

In this well-written paper the authors propose an elegant first-order

*extension**of*the so-called*Hennessy*-*Milner**logic*for reasoning about processes with message passing capabilities. ... 96h:68124 sality problem is to*decide*whether or not the language*of*a given automaton over X comprises all the timed words over Z. ...
« Previous

*Showing results 1 — 15 out of 629 results*