A Categorical Approach to Simulations

Palomino, Miguel; Meseguer, José; Martí-Oliet, Narciso

doi:10.1007/11548133_20

Cited by 5 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have introduced several concepts of simulations and shown some basic results about them; M. Palomino's PhD thesis [29] (in Spanish) deals with this subject in more detail, also covering: equational abstractions, simulations of protocols, algebraic simulations in rewriting logic, and categories of Kripke structures and simulations. Related conference papers in English include [22,26,30]. The study of simulations in the presence of strategies is work in progress.…”

Section: Discussionmentioning

confidence: 99%

“…The notion of simulation is appropriate for this, but we notice that the mismatch in atomicity requires the additional flexibility provided by the notion of stuttering simulation, that we also introduced in the context of rewriting logic in previous conference papers [22,30]. Here we use this concept to show that a stack machine correctly implements the operational semantics of a functional language.…”

Section: Introductionmentioning

confidence: 93%

See 1 more Smart Citation

Strategies and simulations in a semantic framework

Martí-Oliet

Palomino

Verdejo

2007

Journal of Algorithms

Self Cite

View full text Add to dashboard Cite

By means of several examples of structural operational semantics for a variety of languages, we justify the importance and interest of using the notions of strategies and simulations in the semantic framework provided by rewriting logic and implemented in the Maude metalanguage. On the one hand, we describe a basic strategy language for Maude and show its application to CCS, the ambient calculus, and the parallel functional language Eden. On the other hand, we show how the concept of stuttering simulation can be used inside Maude to show that a stack machine correctly implements the operational semantics of a simple functional language.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 93%

Strategies and simulations in a semantic framework

Martí-Oliet

Palomino

Verdejo

2007

Journal of Algorithms

Self Cite

View full text Add to dashboard Cite

show abstract

“…The general idea is to use algebraic and/or rewriting logic methods to define such an H as either a function or a relation. Another idea explored in depth in [332,377] is that simulations and stuttering simulations are arrows in appropriate categories, so that they can be composed, i.e., the entire approach is compositional, so that we can combine several of the above-mentioned abstraction methods to arrive at the desired abstraction. A general emphasis common to all the abstraction methods presented in [192,302,331,332] is on the inductive proof obligations that need to be discharged in order to prove that the proposed simulation H is correct.…”

Section: Simulation and Abstractionmentioning

confidence: 99%

Twenty years of rewriting logic

Meseguer

2012

The Journal of Logic and Algebraic Programming

Self Cite

151

View full text Add to dashboard Cite

Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations; (ii) its semantic framework and logical framework uses; (iii) its language implementations and its formal tools; and (iv) its many applications to automated deduction, software and hardware specification and verification, security, real-time and cyber-physical systems, probabilistic systems, bioinformatics and chemical systems.

show abstract

“…The institution of [12] resembles our local institution and uses lts's as models, but its logic contains also first-order constructs. An institution for CTL * and Kripke structures is given in [18]. Institutions aside, our local logic is related to other actionbased variants of CTL or CTL * , such as ACTL* ( [19]).…”

Section: Related Workmentioning

confidence: 99%

A heterogeneous approach to service-oriented systems specification

Knapp

Marczyński

Wirsing³

et al. 2010

Proceedings of the 2010 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

Service-oriented architecture (SOA) is a relatively new approach to software system development. It divides system functionality to independent, loosely coupled, interoperable services. In this paper we propose a new heterogeneous specification approach for SOA systems where a heterogeneous structured specification consists of a number of specifications of individual services written in a "local" logic and where the specification of their interactions is separately described in a "global" logic. A main feature of our global logic is the possibility of describing the dynamic change of service communications over time. Our approach is based on the theory of institutions: we show that both logics form institutions and that these institutions are connected by an institution comorphism. We illustrate our approach by a simple scenario of an e-university management system and show the power of the heterogeneous specification approach by a compositional refinement of the scenario.

show abstract

A Categorical Approach to Simulations

Cited by 5 publications

References 10 publications

Strategies and simulations in a semantic framework

Strategies and simulations in a semantic framework

Twenty years of rewriting logic

A heterogeneous approach to service-oriented systems specification

Contact Info

Product

Resources

About