Nov 09, · Action refinement involves the replacing of an action by a whole process in the description of parallel processes. It is one of the methods proposed to support the formal study of the step-wise development of concurrent systems. In this award-winning thesis Dr Aceto extends the notion of action Author: Luca Aceto Apr 01, · Action refinement is an abstraction mechanism by which a single action at one descriptive level represents several actions at a more detailed level of description. Technically, the refinement operator "refines" a process by replacing some of its actions by other processes May 01, · In comparative concurrency semantics, one usually distinguishes between linear time and branching time semantic equivalences. Milner's notion of observatin equivalence is often mentioned as the standard example of a branching time equivalence. In this paper we investigate whether observation equivalence really does respect the branching structure of processes,
"Graphical communicating shared resources: A language for the specifica" by Abdallah Hanene Ben
Concurrency, Graphs and Models pp Cite as. We recall some memories of the Esprit Basic Research Action CEDISYS, a small, action algebra computer dissertation distinguished in in process refinement science, well-focussed and fruitful project which brought together researchers at the meeting point of true concurrency and process algebra, in the period 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.
Unable to display preview. Download preview PDF. Skip to main content, action algebra computer dissertation distinguished in in process refinement science. This service is more advanced with JavaScript available.
Advertisement Hide. Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra. Authors Authors and affiliations Gérard Boudol Ilaria Castellani Matthew Hennessy Mogens Nielsen Glynn Winskel. Keywords Transition System Event Structure Operational Semantic Label Transition System Process Algebra These keywords were added by machine and not by the authors.
This process is experimental and the keywords may be updated as the learning algorithm improves. This is a preview of subscription content, log in to check access. Aceto, L. In: Distinguished Dissertations in Computer Science. Cambridge University Press, Cambridge Google Scholar.
Fundamenta Informaticae 17 4— zbMATH MathSciNet Google Scholar. Formal Aspects of Computing 6, — ; Previously appeared as INRIA Research Report n. In: Biswas, S. FSTTCS LNCS, vol. Springer, Heidelberg Google Scholar. Information and Computation 2— ; Extended abstract. In: Proceedings LICSIEEE Computer Society Press zbMATH CrossRef MathSciNet Google Scholar. In: Leach Albert, J.
ICALP Badouel, E. In: Cleaveland, W. CONCUR Springer, Heidelberg CrossRef Google Scholar. Bednarczyk, M. PhD thesis, University of Sussex Google Scholar. Berry, G. Theoretical Computer Science 96, — ; Extended abstract. In: Proceedings POPLpp. Boudol, G. Bulletin of the European Association for Theoretical Computer Science 38, — zbMATH Google Scholar. In: Guessarian, I. LITP School In: Ehrig, H.
CAAP and TAPSOFT Theoretical Computer Science 59, 25—84 CrossRef MathSciNet zbMATH Google Scholar. Fundamenta Informaticae 11 4— zbMATH MathSciNet Google Scholar.
In: de Bakker, J. REX Workshop. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Research ReportINRIA ; Previous version by G. Theoretical Computer Science31—61 ; Extended abstract. In: Tarlecki, A. MFCS Formal Aspects of Computing 6, — ; Extended abstract. Brookes, S. Journal of ACM 31 3— zbMATH CrossRef MathSciNet Google Scholar. Cardelli, L. In: Nivat, M. ETAPS and FOSSACS Castellani, I. Journal of Computer and System Sciences 34, — zbMATH CrossRef MathSciNet Google Scholar.
PhD thesis, University of Edinburgh Google Scholar. Journal of Foundations of Computer Science 4 6— ; Extended abstract. In: Borzyszkowski, A. In: Bergstra, J. Handbook of Process Algebra, pp.
North-Holland, Amsterdam CrossRef Google Scholar. JACM 36 4— zbMATH CrossRef MathSciNet Google Scholar. Theoretical Computer Science— ; Previously appeared as DAIMI Research Report PB,and as INRIA Research Report zbMATH CrossRef MathSciNet Google Scholar. Castellano, L. Bulletin of the EATCS 31, 12—15 zbMATH Google Scholar.
Cattani, G. MSCS 15 3— zbMATH MathSciNet Google Scholar. Christensen, S. Corradini, F. Acta Informatica 34, — zbMATH CrossRef MathSciNet Google Action algebra computer dissertation distinguished in in process refinement science. Danos, V. In: Gardner, P. Darondeau, P. In: ICALP Theoretical Computer Science 121—48 ; Extended abstract. In: Rovan, B. De Cindio, F. In: Proceedings CILBarcelona Google Scholar.
In: European Workshop on Applications and Theory of Petri Nets, pp. De Nicola, R. In: Bidoit, M. CAAPFASEand TAPSOFT IEEE Trans.
on Software Engineering 24 5— CrossRef Google Scholar. Theoretical Computer Science 43, 83— CrossRef Google Scholar. Degano, P. In: Budach, L. FCT In: Proceedings 3rd IFIP WG 2. In: Proceedings LICSIEEE Computer Action algebra computer dissertation distinguished in in process refinement science Press, Los Alamitos Google Scholar.
Theoretical Computer Science 75 3— zbMATH CrossRef MathSciNet Google Scholar. Theoretical Computer Science63—91 ; Extended abstract. In: Proceedings 3rd Workshop on Concurrency and Compositionality, GMD-Studien Nr. In: Kuich, W. Ferrari, G.
2020 DeLisi Distinguished Lecture
, time: 1:13:58Action refinement
Action Algebra Computer Dissertation Distinguished In In Process Refinement Science, Too Much Homework Argumentative Essay, Question Paper For Mathematics Paper2 Grade 10 , How To Close An Argumentative Essay/10() The Communicating Shared Resources (CSR) paradigm is an ongoing project at the University of Pennsylvania to build a framework for the development of real-time systems. The work presented in this thesis is a first step towards incorporating software engineering practices into the CSR paradigm. This is achieved, on one hand, by developing a formal, graphical CSR formalism, In this paper, we develop techniques of action refinement in a real-time process algebra that allows urgent interactions to model timeout. Semantic counterpart is carried out
No comments:
Post a Comment