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

##
###
Compositionality of Hennessy-Milner Logic through Structural Operational Semantics
[chapter]

2003
*
Lecture Notes in Computer Science
*

The method uses the

doi:10.1007/978-3-540-45077-1_38
fatcat:g7xyzxjo4fcejcgef4ckhbye3i
*structural**operational**semantics**of*the process algebra. ... The main contribution*of*this paper is the extension*of*an earlier decomposition method for the De Simone format from the PhD thesis*of*Kim G. Larsen in 1986, to more general formats. ... Preliminaries In this section we give the basic notions*of**Hennessy*-*Milner**Logic*and*structural**operational**semantics*that are needed to define our decomposition method. ...##
###
Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics
[chapter]

2012
*
Lecture Notes in Computer Science
*

The satisfaction problem

doi:10.1007/978-3-642-32940-1_28
fatcat:iu6kqak2pnbh7dbiwnyymt4vlm
*of*a probabilistic HML formula for a process term is reduced to the question*of*whether its subterms satisfy a derived formula obtained via the*operational**semantics*. ... This gives rise to a compositional modal proof system for the satisfaction relation*of*probabilistic process algebras. ... Acknowledgements We are grateful to Simone Tini for discussions on*structural*properties*of**operational**semantics*for PLTSs, and to Bas Luttik for constructive feedback on the presentation*of*the research ...##
###
Page 4546 of Mathematical Reviews Vol. , Issue 93h
[page]

1993
*
Mathematical Reviews
*

(DK-ALBG-CS); Liu, Xin Xin (DK-ALBG-CS)

*Compositionality**through*an*operational**semantics**of*contexts. J.*Logic*Comput. 1 (1991), no. 6, 761-795. ... An*operational**semantics**of*contexts is given, describing how contexts interact with the environment (external observer). Using (*Hennessy*-*Milner**logic*with) recursion, the authors extend G. ...##
###
Bisimulation and Hennessy-Milner Logic for Generalized Synchronization Trees

2017
*
Electronic Proceedings in Theoretical Computer Science
*

In this work, we develop a generalization

doi:10.4204/eptcs.255.3
fatcat:5oey6mtctbh3jg6dokedjjg2rq
*of**Hennessy*-*Milner**Logic*(HML) for Generalized Synchronization Trees (GSTs) that we call Generalized*Hennessy**Milner**Logic*(GHML). ... We also exhibit some interesting characteristics*of*these maximal*Hennessy*-*Milner*classes*of*GSTs. ...*Hennessy*-*Milner**Logic*and a*Hennessy*-*Milner*Class*Hennessy*-*Milner**Logic**Hennessy*-*Milner**Logic*is defined as follows; note the lack*of*atomic propositions. ...##
###
A domain equation for bisimulation

1991
*
Information and Computation
*

The relationship

doi:10.1006/inco.1991.9999
fatcat:yqzr274mh5cghegsrwpgywrupy
*of*this domain*logic*to the standard*Hennessy*-*Milner**logic*for transition systems is studied; the domain*logic*can be seen as a rational reconstruction*of**Hennessy*-*Milner**logic*from the ... Some basic topics in the theory*of*concurrency are studied from the point*of*view*of*denotational*semantics*, and particularly the "domain theory in*logical*form" developed by the author. ... The relationship*of*this domain*logic*to the standard*Hennessy*-*Milner**logic*for transition systems is studied; the domain*logic*can be seen as a rational reconstruction*of**Hennessy*-*Milner**logic*from the ...##
###
Modular Construction of Modal Logics
[chapter]

2004
*
Lecture Notes in Computer Science
*

We show that the syntax,

doi:10.1007/978-3-540-28644-8_17
fatcat:ncw5pnmwjzdyvomfecizrl5p4q
*semantics*and proof systems associated to such*logics*can all be derived in a modular way. ... We use coalgebras to model the behaviour*of*systems, and modal*logics*to specify behavioural properties*of*systems. ... the language associated with a one-step*semantics*which preserves expressiveness has the*Hennessy*-*Milner*property. ...##
###
Utility-based Decision-making in Distributed Systems Modelling
[article]

2013
*
arXiv
*
pre-print

Associated with the calculus is a (

arXiv:1310.6405v1
fatcat:doslcbrehjeovbxi2vvv6l24km
*Hennessy**Milner*-style) context sensitive modal*logic**of*state. As an application, we show how a notion*of*'trust domain' can be defined for multi-agent systems. ... The calculus represents the regulation*of*agents' choices using utility functions that take account*of*context. ... The standard interpretation*of**Hennessy*-*Milner**logics*uses the relation specified by the*operational**semantics*as a Kripke*structure*to support the modal connectives. ...##
###
SOME OF MY FAVOURITE RESULTS IN CLASSIC PROCESS ALGEBRA
[chapter]

2004
*
Current Trends in Theoretical Computer Science
*

I thank all

doi:10.1142/9789812562494_0053
fatcat:l3uurdv3nrbthb4sauro5jau2a
*of*my co-authors and colleagues who have taught me the little I know about this fascinating field*of*research. ... Jos Baeten, Wan Fokkink and Jiří Srba offered incisive comments on previous drafts*of*this paper. The opinions expressed in this note, and any infelicity herein, are solely my responsibility. ... Amongst these, I want to mention here the characterization*of*bisimulation equivalence in terms*of*a modal*logic*that is often referred to as*Hennessy*-*Milner**Logic*. ...##
###
The origins of structural operational semantics

2004
*
The Journal of Logic and Algebraic Programming
*

*semantics*. ... Finally, thanks for comments and other help go to Krzysztof Apt, Henk Barendregt, Mike Gordon, Jan Friso Groote, Matthew

*Hennessy*, Cliff Jones, Gilles Kahn, Robin

*Milner*, Peter Mosses, Flemming Nielson ... I further claimed that it is only

*through*having an

*operational*

*semantics*that the term calculus

*of*the

*logic*could be viewed as a programming language. ...

##
###
Proof systems for satisfiability in Hennessy-Milner Logic with recursion

1990
*
Theoretical Computer Science
*

An extension

doi:10.1016/0304-3975(90)90038-j
fatcat:rcub7xi6mncndiv7y4vilennui
*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. ... Obviously, this quest for*compositionality*is an important one to solve if*Hennessy*-*Milner**Logic*is going to be used in design and verification*of*large systems. ...##
###
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
[chapter]

2008
*
Lecture Notes in Computer Science
*

The project was initiated and effectively animated by Ugo Montanari, a passionate and long-time advocate

doi:10.1007/978-3-540-68679-8_47
fatcat:4f2okdimfnfbfk2j6mdrq5lk3m
*of*both these approaches to the*semantics**of*concurrency. ... We recall some memories*of*the Esprit Basic Research Action CEDISYS, a small, well-focussed and fruitful project which brought together researchers at the meeting point*of*true concurrency and process ... Labelled transition systems were also the prime models for a simple modal*logic*called*Hennessy*-*Milner**logic*[74] , which precisely characterised bisimulation equivalence. ...##
###
Modal characterization of weak bisimulation for higher-order processes
[chapter]

1997
*
Lecture Notes in Computer Science
*

In comparison to previous work by Amadio and Dam [2] on the strong case, our modal

doi:10.1007/bfb0030604
fatcat:sob7m4z2hbgn5fxtm6dawnlize
*logic*supports derived*operators**through*a complete duality and thus constitutes an appealing extension*of**Hennessy*-*Milner*... We present a modal*logic*for this setting and provide a characterization*of*a variant*of*weak context bisimulation on second-order processes. We show how the*logic*permits compositional reasoning. ... We would like to thank Rainer Glas for discussions which helped us to find the right formulation*of*Definition 3.1(1). ...##
###
Structural Operational Semantics and Modal Logic, Revisited

2010
*
Electronical Notes in Theoretical Computer Science
*

A previously introduced combination

doi:10.1016/j.entcs.2010.07.019
fatcat:5ndmofo7l5h6nfnod5ilzfxgdu
*of*the bialgebraic approach to*structural**operational**semantics*with coalgebraic modal*logic*is re-examined and improved in some aspects. ... Firstly, a more abstract, conceptual proof*of*the main*compositionality*theorem is given, based on an understanding*of*modal*logic*as a study*of*coalgebras in slice categories*of*adjunctions. ...*Hennessy*-*Milner**logic*for weak bisimilarity. ...##
###
The origins of structural operational semantics

2004
*
The Journal of Logic and Algebraic Programming
*

I am delighted to see my Aarhus notes [59] on SOS,

doi:10.1016/s1567-8326(04)00026-8
fatcat:s5lg5fdb7nfobp4yl3iiecoz2a
*Structural**Operational**Semantics*, published as part*of*this special issue. ... I recall not much liking this way*of*doing*operational**semantics*. It seemed far too complex, burying essential*semantical*ideas in masses*of*detail; further, the machine states were too big. ...*semantics*. ...##
###
Robin Milner's Work on Concurrency

2010
*
Electronical Notes in Theoretical Computer Science
*

We give a short appreciation

doi:10.1016/j.entcs.2010.08.002
fatcat:h3svrr6qxbgvzdcdb4tvhghcce
*of*Robin Milner's seminal contributions to the theory*of*concurrency. ... This led inexorably in turn to notions*of*observational equivalence. • In the train*of*these ideas came a host*of*technical developments: equational axiomatizations,*Hennessy*-*Milner**logic*, algorithmics ... Key examples include:*Structural**Operational**Semantics*(Gordon Plotkin), bisimulation (David Park),*structural*congruence (Gérard Berry and Gérard Boudol), monoidal categories*of*processes (José Meseguer ...
« Previous

*Showing results 1 — 15 out of 215 results*