A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
Behavioural Equivalence via Modalities for Algebraic Effects
[article]
2019
arXiv
pre-print
The paper investigates behavioural equivalence between programs in a call-by-value functional language extended with a signature of (algebraic) effect-triggering operations. ...
We show that the openness and decomposability conditions hold for several examples of algebraic effects: nondeterminism, probabilistic choice, global store and input/output. ...
We thank Francesco Gavazzo, Aliaume Lopez and the anonymous conference and journal reviewers for helpful discussions and comments. ...
arXiv:1904.08843v3
fatcat:t5jwpi5frvetrgh5wge7jlszxe
Behavioural Equivalence via Modalities for Algebraic Effects
[chapter]
2018
Lecture Notes in Computer Science
The paper investigates behavioural equivalence between programs in a call-by-value functional language extended with a signature of (algebraic) effect-triggering operations. ...
We show that the openness and decomposability conditions hold for several examples of algebraic effects: nondeterminism, probabilistic choice, global store and input/output. A. ...
We thank Francesco Gavazzo, Aliaume Lopez and the anonymous referees for helpful discussions and comments. ...
doi:10.1007/978-3-319-89884-1_11
fatcat:sxvocccabzawbnuwjzz5zs5hyi
Modal Reasoning = Metric Reasoning, via Lawvere
[article]
2021
arXiv
pre-print
We prove such a relation to be a congruence, this way obtaining a compositional technique for reasoning about modal and coeffectful behaviours. ...
In this work, we show that coinductive equivalences can be extended to a modal setting, and we do so by generalising Abramsky's applicative bisimilarity to coeffectful behaviours. ...
As a consequence, we obtain a collection of relational and metriclike techniques for reasoning about programs exhibiting both effectful and coeffectful behaviours.
VIII. ...
arXiv:2103.03871v1
fatcat:x6prnsruf5fdtpyrhgv5fzk4vu
Exploiting Modal Logic to Express Performance Measures
[chapter]
2000
Lecture Notes in Computer Science
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. ...
Tools compute the numerical solution of these models; however, the stochastic process algebra methodology has lacked support for the specification and calculation of complex performance measures. ...
The study of temporal and modal logics in conjunction with process algebras is well-established. ...
doi:10.1007/3-540-46429-8_18
fatcat:4x5mfc2h5bdodbqebdpmanrlwe
Algebraic–coalgebraic specification in CoCasl
2006
The Journal of Logic and Algebraic Programming
This logic includes a generic definition of modal operators for observers with structured equational result types. ...
Moreover, it provides syntactic sugar for an observer-indexed modal logic that allows e.g. expressing fairness properties. ...
We also thank Hendrik Tews for useful discussions on the relation between CCSL and CoCasl. ...
doi:10.1016/j.jlap.2005.09.006
fatcat:okuywxa2cjcpji2san2ozfnjfi
Dynamic model reduction: An overview of available techniques with application to power systems
2012
Serbian Journal of Electrical Engineering
This paper summarises the model reduction techniques used for the reduction of large-scale linear and nonlinear dynamic models, described by the differential and algebraic equations that are commonly used ...
The groups of methods discussed in this paper for reduction of the linear dynamic model are based on singular perturbation analysis, modal analysis, singular value decomposition, moment matching and methods ...
In [83] a method for dynamic equivalencing, termed synchronic modal equivalencing (SME), based on synchrony and modal equivalencing, is proposed, and algorithms for constructing effective dynamic equivalents ...
doi:10.2298/sjee1202131d
fatcat:k2nqxgyb4ralbedtzcovghfhyq
Algebraic-Coalgebraic Specification in CoCasl
[chapter]
2003
Lecture Notes in Computer Science
This logic includes a generic definition of modal operators for observers with structured equational result types. ...
Moreover, it provides syntactic sugar for an observer-indexed modal logic that allows e.g. expressing fairness properties. ...
We also thank Hendrik Tews for useful discussions on the relation between CCSL and CoCasl. ...
doi:10.1007/978-3-540-40020-2_22
fatcat:rwzoyted2bhcbks3kqc6p7pk6q
Program Equivalence (Dagstuhl Seminar 18151)
2018
Dagstuhl Reports
Program equivalence is the problem of proving that two programs are equal under some definition of equivalence, e.g., input-output equivalence. ...
This report documents the program and the outcomes of Dagstuhl Seminar 18151 "Program Equivalence". The seminar was organized by the four official organizers mentioned above, and Dr. ...
In this talk we present recent advances in devising game models for effectful computation. ...
doi:10.4230/dagrep.8.4.1
dblp:journals/dagstuhl-reports/LahiriMSU18
fatcat:6okakmyai5auths2irdwghogzm
Quantitative Logics for Equivalence of Effectful Programs
[article]
2019
arXiv
pre-print
In order to reason about effects, we can define quantitative formulas to describe behavioural aspects of effectful programs. ...
We investigate these results in the context of Levy's call-by-push-value with general recursion and algebraic effects. ...
Acknowledgements: I would like to thank Alex Simpson, Francesco Gavazzo and Aliaume Lopez for all the helpful discussions and comments. ...
arXiv:1904.11771v1
fatcat:cu47fs4i6bce5ll5ktsh2mkdue
Specifying Performance Measures for PEPA
[chapter]
1999
Lecture Notes in Computer Science
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. ...
Tools compute the numerical solution of these models; however, the stochastic process algebra methodology lacks support for the specification and calculation of complex performance measures. ...
Markovian process algebras are enhanced with information about the duration of activities and, via a race policy, their relative probabilities. ...
doi:10.1007/3-540-48778-6_13
fatcat:7t4oikmiyfbqdid7f4lswlyxy4
A Sound and Complete Logic for Algebraic Effects
[chapter]
2019
Green Chemistry and Sustainable Technology
This work investigates three notions of program equivalence for a higher-order functional language with recursion and general algebraic effects, in which programs are written in continuation-passing style ...
with a contextual equivalence. ...
We would like to thank Niels Voorneveld for pointing out example (1), Alex Simpson and Ohad Kammar for useful discussions, and the anonymous reviewers for comments and suggestions. ...
doi:10.1007/978-3-030-17127-8_22
dblp:conf/fossacs/MatacheS19
fatcat:kdnvsrw7bnhdhc56guu5iawjjm
Observational structures and their logic
1992
Theoretical Computer Science
For example it is shown that for finitely observable structures the observational equivalence is obtainable as a limit of a denumerable chain of iterations; our conditions, which apply to algebraic structures ...
observationally equivalent if and only if they satisfy the same set of modal observational formulas. ...
Their approaches are, however, different; they define classes of models (@-algebras in [ [ lo] ) and get the notion of maximum observational equivalence via terminality. ...
doi:10.1016/0304-3975(92)90186-j
fatcat:lgdxisxd7jer7fvjzjsvnbtw44
Page 4457 of Mathematical Reviews Vol. , Issue 82j
[page]
1982
Mathematical Reviews
“We first define equivalence of agents in two ways—first intrinsically, and then extrinsically via properties expressed in a simple modal language. ...
any tape y, y* is the tape
obtained by rotating y clockwise 90°.”
82j:68034
82j:68036
Automata
8768039
Milner, R. 82j:68037 A modal characterisation of observable machine-behaviour. ...
Coalgebraic semantics of modal logics: An overview
2011
Theoretical Computer Science
, expressiveness and complexity in these settings, both for basic languages as well as a number of extensions, such as hybrid languages and fixpoints. ...
In the same sense, coalgebraic logics are generalised modal logics. In this paper, we give an overview of the basic tools, techniques and results that connect coalgebras and modal logic. ...
Acknowledgements We thank our colleagues in the field for many lively discussions and the editors of this volume for their continued patience. ...
doi:10.1016/j.tcs.2011.04.023
fatcat:ffi53okdkzeqtbyqt5phjdrfaa
TAPAs: A Tool for the Analysis of Process Algebras
[chapter]
2008
Lecture Notes in Computer Science
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. ...
Another useful feature in this respect is the exhibition of counterexamples in case equivalences are not verified or the proposed formulae are not satisfied. ...
We would like to thank Fabio Collini, Massimiliano Gori, Stefano Guerrini and Guzman Tierno for having contributed with their master theses to begin the development of key parts of the software at the ...
doi:10.1007/978-3-540-89287-8_4
fatcat:rjozyivhgvgvjj4uosqgwu7m5m
« Previous
Showing results 1 — 15 out of 5,436 results