Filters








313 Hits in 1.1 sec

A Generative Approach to Building a Framework for Hard Real-Time Applications

Irfan Hamid, Irfan Hamid, Irfan Hamid, Irfan Hamid, Elie Najm, Elie Najm, Elie Najm, Elie Najm, J Hugues, J Hugues, J Hugues, J Hugues
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qhesqg5ocnglrdlb3l2oqthvrq" style="color: black;">IEEE Software Engineering Workshop</a> </i> &nbsp;
The communication and tasking infrastructure of a realtime application makes up a significant portion of any embedded control system. Traditionally, the tasking and communication constructs are provided by an RTOS. We present an approach to automatically generate a robust framework for a single-node application from its architectural description. This framework sits atop a Ravenscar-compliant runtime as opposed to a standard RTOS. Finally, we present an extension of our approach to support code
more &raquo; ... generation for distributed applications. Authorized licensed use limited to: IEEE Xplore. Downloaded on March 30, 2009 at 08:46 from IEEE Xplore. Restrictions apply.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sew.2007.83">doi:10.1109/sew.2007.83</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sew/HamidNH07.html">dblp:conf/sew/HamidNH07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/aq4m6uxvfjehdclj57uw32r4lu">fatcat:aq4m6uxvfjehdclj57uw32r4lu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706044656/http://perso.telecom-paristech.fr/~najm/publications/hamid-zalila-najm-hugues-nasa-workshop-07.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b3/ad/b3add3593544bbe588bbb88961e4b67257ead1e2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sew.2007.83"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Age of Information: The Gamma Awakening [article]

Elie Najm, Rajai Nasser
<span title="2016-04-05">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We consider a scenario where a monitor is interested in being up to date with respect to the status of some system which is not directly accessible to this monitor. However, we assume a source node has access to the status and can send status updates as packets to the monitor through a communication system. We also assume that the status updates are generated randomly as a Poisson process. The source node can manage the packet transmission to minimize the age of information at the destination
more &raquo; ... de, which is defined as the time elapsed since the last successfully transmitted update was generated at the source. We use queuing theory to model the source-destination link and we assume that the time to successfully transmit a packet is a gamma distributed service time. We consider two packet management schemes: LCFS (Last Come First Served) with preemption and LCFS without preemption. We compute and analyze the average age and the average peak age of information under these assumptions. Moreover, we extend these results to the case where the service time is deterministic.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1604.01286v1">arXiv:1604.01286v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gosaq2xcdbeevglqpjonrlczmy">fatcat:gosaq2xcdbeevglqpjonrlczmy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200909213323/https://arxiv.org/pdf/1604.01286v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/82/86/828619d62e3573e709fccfcc91c0f050c8c10060.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1604.01286v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Simplex Queues for Hot-Data Download [article]

Mehmet Fatih Aktas, Elie Najm, Emina Soljanin
<span title="2018-04-17">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In cloud storage systems, hot data is usually replicated over multiple nodes in order to accommodate simultaneous access by multiple users as well as increase the fault tolerance of the system. Recent cloud storage research has proposed using availability codes, which is a special class of erasure codes, as a more storage efficient way to store hot data. These codes enable data recovery from multiple, small disjoint groups of servers. The number of the recovery groups is referred to as the
more &raquo; ... ability and the size of each group as the locality of the code. Until now, we have very limited knowledge on how code locality and availability affect data access time. Data download from these systems involves multiple fork-join queues operating in-parallel, making the analysis of access time a very challenging problem. In this paper, we present an approximate analysis of data access time in storage systems that employ simplex codes, which are an important and in certain sense optimal class of availability codes. We consider and compare three strategies in assigning download requests to servers; first one aggressively exploits the storage availability for faster download, second one implements only load balancing, and the last one employs storage availability only for hot data download without incurring any negative impact on the cold data download.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.06489v1">arXiv:1804.06489v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ogt7qifwvzanhbypik3hmyotxe">fatcat:ogt7qifwvzanhbypik3hmyotxe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191020040443/https://arxiv.org/pdf/1804.06489v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/43/e7/43e71c2ecade460fb39b030b988cc77f56b07fcd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.06489v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Service Feature Interaction [chapter]

Elie Najm
<span title="">2000</span> <i title="Springer US"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kss7mrolvja63k4rmix3iynkzi" style="color: black;">IFIP Advances in Information and Communication Technology</a> </i> &nbsp;
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-35581-8_7">doi:10.1007/978-0-387-35581-8_7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m3dsc7llonby5iuf7fvbtahfhy">fatcat:m3dsc7llonby5iuf7fvbtahfhy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190503143448/https://link.springer.com/content/pdf/10.1007%2F978-0-387-35581-8_7.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ed/ba/edba2b99264bb058cb0f534b871cf79cab725ef0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-35581-8_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Reactive EFSMs — Reactive Promela/RSPIN [chapter]

Elie Najm, Frank Olsen
<span title="">1996</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
To model the protocol in Reactive Promela we decompose it into five automata two of which are 7The example is taken from a course in protocol specification given by F, lie Najm at ENST.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-61042-1_54">doi:10.1007/3-540-61042-1_54</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/et4l62pa5rhnfc5mozodxx4yha">fatcat:et4l62pa5rhnfc5mozodxx4yha</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180730040039/https://link.springer.com/content/pdf/10.1007%2F3-540-61042-1_54.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f3/4a/f34a4b472725491a30fac53bf6ad69f04bc42471.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-61042-1_54"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Simplex Queues for Hot-Data Download

Mehmet Fatih Aktas, Elie Najm, Emina Soljanin
<span title="2017-06-05">2017</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pkal2zplnrarzkkzugv4u5ithy" style="color: black;">Performance Evaluation Review</a> </i> &nbsp;
In cloud storage systems, hot data is usually replicated over multiple disks/servers in order to accommodate simultaneous access by multiple users as well as increase the fault tolerance of the system. Recent cloud storage research has proposed using availability codes, which is a special class of erasure codes, as a more storagee cient way to store hot data. ese codes enable data recovery from multiple, small disjoint groups of servers. e number of the recovery groups is referred to as the
more &raquo; ... lability and the size of each group as the locality of the code. Up till now, we have very limited knowledge on how code locality and availability a ect data access time. Data download from these systems involves multiple fork-join queues operating in-parallel, making the analysis of access time a very challenging problem. In this paper, we present an analysis of average data access time in storage systems employing simplex codes, which are an important, in certain sense optimal, class of availability codes. We generalize the analysis for codes with locality 2 and any degree of availability. Speci cally, using a queueing theoretic approach, we derive bounds and approximations on the average response time for two di erent Poisson request arrival models. We also compare two scheduling strategies for reduced access time and load balancing.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3143314.3078553">doi:10.1145/3143314.3078553</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hw4zaolfqnbn3oijperycijhma">fatcat:hw4zaolfqnbn3oijperycijhma</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720004801/https://infoscience.epfl.ch/record/227412/files/main.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9d/90/9d90c9acdd2717d1a0d4c5072559ebf2cdd3b632.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3143314.3078553"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Protocol verification with reactive PROMELA/RSPIN [chapter]

Elie Najm, Frank Olsen
<span title="1997-05-27">1997</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vvrs4aeb5fbclnb6drlj6n6v5i" style="color: black;">The SPIN Verification System</a> </i> &nbsp;
The example is taken from a course in protocol speci cation given by Elie Najm at ENST. 4 This description is not complete, notably with respect to the use of timers for more information we refer to appendix  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1090/dimacs/032/09">doi:10.1090/dimacs/032/09</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/dimacs/NajmO96.html">dblp:conf/dimacs/NajmO96</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wpzaf4mpxrddfjh7juv2gt7ys4">fatcat:wpzaf4mpxrddfjh7juv2gt7ys4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20030725025223/http://spinroot.com:80/spin/Workshops/ws96/Ol.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bc/f2/bcf2d00091042d9e211bec486814a7ee6bbc58fa.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1090/dimacs/032/09"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Formal Support for ODP and Teleservices [chapter]

Joubine Dutszadeh, Elie Najm
<span title="">1996</span> <i title="Springer US"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kss7mrolvja63k4rmix3iynkzi" style="color: black;">IFIP Advances in Information and Communication Technology</a> </i> &nbsp;
For instance, its ability to support (although not naturally) dynamic configuration has been shown in (Najm and Stefani 1991) .  ...  It is worth noting that much research is now being carried out to endow these models with formal semantics, either directly (Dustzadeh and Najm, 1996) or through a translation to Z (B.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-34985-5_3">doi:10.1007/978-0-387-34985-5_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4tgpaqmsrrgcbejxoaok6jiw4u">fatcat:4tgpaqmsrrgcbejxoaok6jiw4u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200325085117/https://link.springer.com/content/pdf/10.1007%2F978-0-387-34985-5_3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ee/25/ee25082a68768e5c576e97b2b1909a6be1779aa5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-34985-5_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Age of information: The gamma awakening

Elie Najm, Rajai Nasser
<span title="">2016</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ux5tf45dtrgptnezraiii73msm" style="color: black;">2016 IEEE International Symposium on Information Theory (ISIT)</a> </i> &nbsp;
Status update systems is an emerging field of study that is gaining interest in the information theory community. We consider a scenario where a monitor is interested in being up to date with respect to the status of some system which is not directly accessible to this monitor. However, we assume a source node has access to the status and can send status updates as packets to the monitor through a communication system. We also assume that the status updates are generated randomly as a Poisson
more &raquo; ... ocess. The source node can manage the packet transmission to minimize the age of information at the destination node, which is defined as the time elapsed since the last successfully transmitted update was generated at the source. We use queuing theory to model the source-destination link and we assume that the time to successfully transmit a packet is a gamma distributed service time. We consider two packet management schemes: LCFS with preemption and LCFS without preemption. We compute and analyze the average age and the average peak age of information under these assumptions. Moreover, we extend these results to the case where the service time is deterministic.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isit.2016.7541764">doi:10.1109/isit.2016.7541764</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/isit/NajmN16.html">dblp:conf/isit/NajmN16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lgk5rnmxnffonjpuw7dubvskri">fatcat:lgk5rnmxnffonjpuw7dubvskri</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170824191723/https://infoscience.epfl.ch/record/215309/files/Age_of_information_gamma_service_time_with_without_preemption_1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e5/7d/e57d8cb078ca5a59dc5805e8fa7933cf816f0741.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isit.2016.7541764"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Behavioural Contracts for a Sound Assembly of Components [chapter]

Cyril Carrez, Alessandro Fantechi, Elie Najm
<span title="">2003</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The guarantee of the satisfaction of well-typedness and liveness properties has been dealt by Najm, Nimour and Stefani [NNS99] , and we have inherited their approach in showing how the satisfaction of  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-39979-7_8">doi:10.1007/978-3-540-39979-7_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yig7fqjqzze7fiquiggmdwbbka">fatcat:yig7fqjqzze7fiquiggmdwbbka</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20051014200517/http://www.infres.enst.fr/%7Enajm/publications/carrez-fantechi-najm-contracts-components-forte-03.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/78/b4/78b45d9d9eac7f39222d96608b393216bb4d528f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-39979-7_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Invited Paper — Computational models for open distributed systems [chapter]

Elie Najm, Jean-Bernard Stefani
<span title="">1997</span> <i title="Springer US"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kss7mrolvja63k4rmix3iynkzi" style="color: black;">IFIP Advances in Information and Communication Technology</a> </i> &nbsp;
The notion of computational model is central to the Reference Model for Open Distributed Processing. It defines an abstract model for distributed computations and characterizes at the same time the functionality of a supporting distributed virtual machine. Most current distributed systems, including e.g. the CORBA platforms, have converged on a subset of this computational model. In this paper, we review the model, providing a formal characterization for it, and we discuss various directions
more &raquo; ... extensions, considering in particular different trends in distributed systems construction.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-35261-9_11">doi:10.1007/978-0-387-35261-9_11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ubznnveodvbzjnk6jrbkth7zva">fatcat:ubznnveodvbzjnk6jrbkth7zva</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200326145832/https://link.springer.com/content/pdf/10.1007%2F978-0-387-35261-9_11.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/65/2f/652f95fbdc0cca96b6974ac864c23008a88de9f1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-35261-9_11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Infinite Types for Distributed Object Interfaces [chapter]

Elie Najm, Abdelkrim Nimour, Jean-Bernard Stefani
<span title="">1999</span> <i title="Springer US"> Formal Methods for Open Object-Based Distributed Systems </i> &nbsp;
1 Ecole Nationale Superieure des Telecomunications [Elie.Najm, Abdelkrim.Nimour]@enstfr In a previous work [12] we presented COB, an object calculus which features objects with dynamically changing service offers. We also defined a type system for interfaces and a typing discipline that guarantees that no object may experience an unexpected service request at run-time. In the present paper, we extend our type system such that it describes "infinite state" types. We define equivalence and
more &raquo; ... ng relations over those types based on bisimulation and simulation relations. We also define an algorithm to decide the equivalence or the subtyping relation of two types. The type system is applied to OL, a new calculus that uses the interface "states" in the behavior of the objects. As in COB, in OL there is a distinction between private and public interfaces. A private interface can have at most one client at a time whereas a public interface can be known by more that one client. Private interfaces can thus propose a non-uniform service offer (the set available services may change during the computation). OL extends the results of COB to infinite types: in spite of non-uniform service offers, in a well-typed P. Ciancarini et al. (eds.), Formal Methods for Open Object-Based Distributed Systems
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-35562-7_28">doi:10.1007/978-0-387-35562-7_28</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xonpeyb77vay5fjobfskzcekdy">fatcat:xonpeyb77vay5fjobfskzcekdy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030095403/https://link.springer.com/content/pdf/10.1007%2F978-0-387-35562-7_28.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7c/cb/7ccb87d9aa8002f14442ad01b73b588775679deb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-35562-7_28"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Adding Sessions to BPEL

Jonathan Michaux, Elie Najm, Alessandro Fantechi
<span title="2012-10-22">2012</span> <i title="Open Publishing Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzezkwolyvf33pglm2jldjklca" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a> </i> &nbsp;
By considering an essential subset of the BPEL orchestration language, we define SeB, a session based style of this subset. We discuss the formal semantics of SeB and we present its main properties. We use a new approach to address the formal semantics, based on a translation into so-called control graphs. Our semantics handles control links and addresses the static semantics that prescribes the valid usage of variables. We also provide the semantics of collections of networked services.
more &raquo; ... on these semantics, we define precisely what is meant by interaction safety, paving the way to the formal analysis of safe interactions between BPEL services.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.98.7">doi:10.4204/eptcs.98.7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3ifjvo7la5hkfpfb3xya3ztlky">fatcat:3ifjvo7la5hkfpfb3xya3ztlky</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1210.6114/1210.6114.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.98.7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Compositional Specification of ODP Binding Objects [chapter]

Arnaud Février, Elie Najm, Guy Leduc, Luc Léonard
<span title="">1996</span> <i title="Springer US"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kss7mrolvja63k4rmix3iynkzi" style="color: black;">IFIP Advances in Information and Communication Technology</a> </i> &nbsp;
These extensions are formally speci ed and discussed in (L onard 1994, L onard 1995) and (Najm 1995a , Najm 1995b .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-34985-5_21">doi:10.1007/978-0-387-34985-5_21</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3n25uvrm3vfpnmeuhhmuvpphp4">fatcat:3n25uvrm3vfpnmeuhhmuvpphp4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190429082436/https://orbi.uliege.be/bitstream/2268/32923/2/RUN-PP96-03.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c0/2f/c02fa42ddbcdcb85b4d35391df8128c634a7fa8f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-34985-5_21"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Timely updates over an erasure channel

Roy D. Yates, Elie Najm, Emina Soljanin, Jing Zhong
<span title="">2017</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ux5tf45dtrgptnezraiii73msm" style="color: black;">2017 IEEE International Symposium on Information Theory (ISIT)</a> </i> &nbsp;
Using an age of information (AoI) metric, we examine the transmission of coded updates through a binary erasure channel to a monitor/receiver. We start by deriving the average status update age of an infinite incremental redundancy (IIR) system in which the transmission of a k-symbol update continues until k symbols are received. This system is then compared to a fixed redundancy (FR) system in which each update is transmitted as an n symbol packet and the packet is successfully received if and
more &raquo; ... only if at least k symbols are received. If fewer than k symbols are received, the update is discarded. Unlike the IIR system, the FR system requires no feedback from the receiver. For a single monitor system, we show that tuning the redundancy to the symbol erasure rate enables the FR system to perform as well as the IIR system. As the number of monitors is increased, the FR system outperforms the IIR system that guarantees delivery of all updates to all monitors.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isit.2017.8006541">doi:10.1109/isit.2017.8006541</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/isit/YatesNSZ17.html">dblp:conf/isit/YatesNSZ17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/72al6rb3tjefrnixs2rfjcfnxq">fatcat:72al6rb3tjefrnixs2rfjcfnxq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180725032606/https://infoscience.epfl.ch/record/224673/files/StatusNFR-22.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/55/d0/55d000dda44e925b605132d53576ce8fd523c48a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isit.2017.8006541"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 313 results