Filters








215 Hits in 5.0 sec

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

Wan Fokkink, Rob van Glabbeek, Paulien de Wind
2003 Lecture Notes in Computer Science  
The method uses the 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.  ... 
doi:10.1007/978-3-540-45077-1_38 fatcat:g7xyzxjo4fcejcgef4ckhbye3i

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

Daniel Gebler, Wan Fokkink
2012 Lecture Notes in Computer Science  
The satisfaction problem 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  ... 
doi:10.1007/978-3-642-32940-1_28 fatcat:iu6kqak2pnbh7dbiwnyymt4vlm

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

James Ferlez, Rance Cleaveland, Steve Marcus
2017 Electronic Proceedings in Theoretical Computer Science  
In this work, we develop a generalization 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.  ... 
doi:10.4204/eptcs.255.3 fatcat:5oey6mtctbh3jg6dokedjjg2rq

A domain equation for bisimulation

Samson Abramsky
1991 Information and Computation  
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  ...  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  ... 
doi:10.1006/inco.1991.9999 fatcat:yqzr274mh5cghegsrwpgywrupy

Modular Construction of Modal Logics [chapter]

Corina Cîrstea, Dirk Pattinson
2004 Lecture Notes in Computer Science  
We show that the syntax, 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.  ... 
doi:10.1007/978-3-540-28644-8_17 fatcat:ncw5pnmwjzdyvomfecizrl5p4q

Utility-based Decision-making in Distributed Systems Modelling [article]

Gabrielle Anderson, Matthew Collinson, David Pym
2013 arXiv   pre-print
Associated with the calculus is a (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.  ... 
arXiv:1310.6405v1 fatcat:doslcbrehjeovbxi2vvv6l24km

SOME OF MY FAVOURITE RESULTS IN CLASSIC PROCESS ALGEBRA [chapter]

LUCA ACETO
2004 Current Trends in Theoretical Computer Science  
I thank all 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.  ... 
doi:10.1142/9789812562494_0053 fatcat:l3uurdv3nrbthb4sauro5jau2a

The origins of structural operational semantics

Gordon D Plotkin
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.  ... 
doi:10.1016/j.jlap.2004.03.009 fatcat:vdx7e5gj5betpnxl7yxgd3zily

Proof systems for satisfiability in Hennessy-Milner Logic with recursion

Kim G. Larsen
1990 Theoretical Computer Science  
An 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.  ...  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.  ... 
doi:10.1016/0304-3975(90)90038-j fatcat:rcub7xi6mncndiv7y4vilennui

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra [chapter]

Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Mogens Nielsen, Glynn Winskel
2008 Lecture Notes in Computer Science  
The project was initiated and effectively animated by Ugo Montanari, a passionate and long-time advocate 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.  ... 
doi:10.1007/978-3-540-68679-8_47 fatcat:4f2okdimfnfbfk2j6mdrq5lk3m

Modal characterization of weak bisimulation for higher-order processes [chapter]

Michael Baldamus, Jürgen Dingel
1997 Lecture Notes in Computer Science  
In comparison to previous work by Amadio and Dam [2] on the strong case, our modal 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).  ... 
doi:10.1007/bfb0030604 fatcat:sob7m4z2hbgn5fxtm6dawnlize

Structural Operational Semantics and Modal Logic, Revisited

Bartek Klin
2010 Electronical Notes in Theoretical Computer Science  
A previously introduced combination 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.  ... 
doi:10.1016/j.entcs.2010.07.019 fatcat:5ndmofo7l5h6nfnod5ilzfxgdu

The origins of structural operational semantics

G PLOTKIN
2004 The Journal of Logic and Algebraic Programming  
I am delighted to see my Aarhus notes [59] on SOS, 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.  ... 
doi:10.1016/s1567-8326(04)00026-8 fatcat:s5lg5fdb7nfobp4yl3iiecoz2a

Robin Milner's Work on Concurrency

Samson Abramsky
2010 Electronical Notes in Theoretical Computer Science  
We give a short appreciation 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  ... 
doi:10.1016/j.entcs.2010.08.002 fatcat:h3svrr6qxbgvzdcdb4tvhghcce
« Previous Showing results 1 — 15 out of 215 results