Luis Alonso

Luis Alonso
Universidad del País Vasco / Euskal Herriko Unibertsitatea | UPV/EHU · Computer Languages and Systems

About

6
Publications
75
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
15
Citations

Publications

Publications (6)
Article
Portlet syndication is the next wave following the successful use of content syndication in current portals. Portlets can be regarded as Web components, and the portal as the component container where portlets are aggregated to provide higher-order applications. This perspective requires a departure from how current Web portals are envisaged. The p...
Conference Paper
A technique for the specification of TCSP processes based upon the concept of states and state variables is presented. It is shown how safety and liveness properties can be proved for processes specified in this way. Parallel composition of specifications is defined, preserving the failures semantics. A technique related to bisimulations is propose...
Conference Paper
Full-text available
A technique for the specification of TCSP processes based upon the concepts of guards and liveness rules is presented. It is shown how safety and liveness properties can be proved for processes specified in this way. A technique related to bisimulations is proposed to prove refinements correct. The technique is extended to handle the concealment of...
Conference Paper
Acceptance Automata, a particular case of labelled transition systems whose semantics is given in terms of the Failures Model, are presented. It is shown how parallel composition and hiding can be defined for them in a way consistent with the TCSP model. A notion of canonical automaton is presented. In the finite case it can be effectively computed...
Chapter
Acceptance Automata, a particular case of labelled transition systems whose semantics is given in terms of the Failures Model, are presented. It is shown how parallel composition and hiding can be defined for them in a way consistent with the TCSP model. A notion of canonical automaton is presented. In the finite case it can be effectively computed...
Conference Paper
Full-text available
A formal framework and a technique for the specification, refinement and correctness proving of parallel systems are presented. Processes are objects in the TCSP model and are specified by means of an auxiliary partial abstract data type. Part of the proofs are made in the abstract data type framework, so more powerful deductive methods can be used...

Network

Cited By