Now showing items 1-20 of 20

• #### A Distributed and mobile component system based on the ambient calculus ﻿

(2004-06)
External research report
Open Access
In this paper we present a new component concept equivalent to a previous one which is more appropiate for distributed applications. After that, we present the notion of component system and define a set of operations of ...
• #### A Framework of hierarchical graphs and its application to the semantics of SRML ﻿

(2012)
External research report
Open Access
Hierarchical grapsh or, in general, hierarchical graph structures are needed when describing visual models at different levels of abstraction. This is the case of the semantic model of SRML, the service modeling language ...
• #### A graph semantics for a variant of the ambient calculus more adequate for modeling SOC ﻿

(2017-02-07)
External research report
Open Access
In this paper we present a graph semantics of a variant of the well known ambient calculus. The main change of our variant is to extract the mobility commands of the original calculus from the ambient topology. Similar ...
• #### A graph-semantics of business configurations ﻿

(2014)
External research report
Open Access
In this paper we give graph-semantics to a fundamental part of the semantics of the service modeling language SRML. To achieve this goal we develop a new graph transformation system for what we call 2-level symbolic graphs. ...
• #### A higher-order behavioural algebraic institution for ASL ﻿

(2003-03-02)
External research report
Open Access
In this paper, we generalise the semantics of ASL including the three behavioural operators for a fixed but arbitrary algebraic institution. After that, we define a behavioural algebraic institution which is used to ...
• #### A semantics of business configurations using symbolic graphs ﻿

(Institute of Electrical and Electronics Engineers (IEEE), 2015)
Conference report
Open Access
In this paper we give graph-semantics to a fundamental part of the semantics of the service modeling language SRML: business configurations. To achieve this goal we use symbolic graph transformation systems. We formalize ...
• #### Adequate encodings of logical systems in UTT ﻿

(2003-03-02)
External research report
Open Access
In this paper, we present an existing and formalized type theory (UTT) as a logical framework. We compare the resulting framework with LF and give the representation of two significant type systems in the framework: ...
• #### An abstract semantic framework for mobile component systems based on graph transformation (Extended abstract) ﻿

(2005-12)
External research report
Open Access
The aim of this work is the definition of a generic framework for the modelling and development of component-based distributed applications with mobile processes in the internet. We describe component systems as typed ...
• #### Another fully abstract graph semantics for the ambient calculus ﻿

(2007-06)
External research report
Open Access
The long-term aim of this work is the definition of a framework for the modelling and development of distributed mobile component-based applications. As a first step we provide a fully abstract graph semantics for the ...
• #### Borrowed contexts for attributed graphs ﻿

(2012)
External research report
Open Access
Borrowed context graph transformation is a simple and powerful technique developed by Ehrig and König that allow us to derive labeled transitions and bisimulation congruences for graph transformation systems or, in general, ...
• #### Checking bisimilarity for attributed graph transformation ﻿

(2012)
External research report
Open Access
Borrowed context graph transformation is a technique developed by Ehrig and Koenig to define bisimilarity congruences from reduction semantics defined by graph transformation. This means that, for instance, this technique ...
• #### Distributed ambient graphs with business configurations ﻿

(2018-01-17)
External research report
Open Access
In this paper we present distributed ambient graphs with business configurations to extend our original model of service oriented computing ($SOC$) with an ambient topology of locations. This ambient topology is based on ...
• #### Finitary non-compositional proof systems for ASL in first-order ﻿

(2003-03-02)
External research report
Open Access
In this paper we present finitary proof systems for the deduction of sentences from algebraic specifications inductively defined by specification expresssions in first-order and higher-order logic. Mainly, we redesign ...
• #### FONAMENTS D' INFORMÀTICA (Examen 2n quadrimestre, 2n parcial) ﻿

(Universitat Politècnica de Catalunya, 2015-06-16)
Exam
• #### FONAMENTS D' INFORMÀTICA (Examen 2n quadrimestre, 2n parcial) ﻿

(Universitat Politècnica de Catalunya, 2015-06-16)
Exam
• #### FONAMENTS D'INFORMÀTICA (Examen 2n quadrimestre, 1r parcial) ﻿

(Universitat Politècnica de Catalunya, 2016-04-12)
Exam
• #### FONAMENTS D'INFORMÀTICA (Examen 2n quadrimestre, 2n parcial) ﻿

(Universitat Politècnica de Catalunya, 2017-06-20)
Exam
• #### Modelling service-oriented computing with temporal symbolic graph transformation systems ﻿

(2015-12-21)
External research report
Open Access
In this paper, we present a novel semantics for an essential aspect of service-oriented computing: the mechanism through which systems evolve through a symbiosis of state transformations and run-time service discovery and ...
• #### Una Notación algorítmica con genericidad y herencia junto con su relación con C++ y Java ﻿

(2003-06)
External research report
Open Access
In this report, we present a new algorithmic notation which extends the notation which this department has used to teach the first courses of programming. The main novelty of this new notation, is the formal definition ...
• #### Proof assistance for refnement in type theory ﻿

(2003-03-02)
External research report
Open Access
In this paper, we represent in type theory a proof system for refinement of algebraic specifications. . The representation is not adequate but full because the use of proof obligations to represent ...