Filters








1,407 Hits in 6.7 sec

Minimality and separation results on asynchronous mobile processes – representability theorems by concurrent combinators

Nobuko Yoshida
2002 Theoretical Computer Science  
Expressive power of several interesting subsystems of the asynchronous -calculus is also measured by using appropriate subsets of the combinators and their variants.  ...  we presented a theory of concurrent combinators for the asynchronous monadic -calculus without match or summation operator.  ...  Acknowledgements The question on the minimality of concurrent combinators was independently posed by Benjamin Pierce, Davide Sangiorgi and Vasco Vasconcelos.  ... 
doi:10.1016/s0304-3975(00)00310-8 fatcat:mfclbbqfr5cevni4p55fupay6m

Page 7881 of Mathematical Reviews Vol. , Issue 99k [page]

1999 Mathematical Reviews  
results on asynchronous mo- bile processesrepresentability theorems by concurrent combi- nators (extended abstract) (131-146); Perdita Stevens, Abstract games for infinite state processes (147-162).  ...  bottom-up theorem provers by subgoal clause trans- fer (157-169); Ken-etsu Fujita, Polymorphic call-by-value calcu- lus based on classical proofs (extended abstract) (170-182); L.  ... 

Page 1318 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
{For the entire collection see MR 2002j:68002. } 2003b:68158 68Q85 Yoshida, Nobuko (4-SUSX-CG; Brighton) Minimality and separation results on asynchronous mobile processes-representability theorems by  ...  of concurrent combinators for the asynchronous monadic z-calculus without match or summation operator.  ... 

On Asynchrony and Choreographies

Luís Cruz-Filipe, Fabrizio Montesi
2017 Electronic Proceedings in Theoretical Computer Science  
We show how our development yields a pleasant correspondence with FIFO-based asynchronous messaging, modelled in a process calculus, and discuss how it can be adopted in more complex choreography models  ...  We explore how out-of-order execution, used in choreographies for modelling concurrency, can be exploited to endow choreographies with an asynchronous semantics.  ...  This work was supported by CRC (Choreographies for Reliable and efficient Communication software), grant no.  ... 
doi:10.4204/eptcs.261.8 fatcat:3dpbtkyblrcxfby22d764gucvm

On the Expressiveness and Decidability of Higher-Order Process Calculi

Ivan Lanese, Jorge A. Perez, Davide Sangiorgi, Alan Schmitt
2008 Logic in Computer Science  
A core calculus of higher-order concurrency is studied; it has only the operators necessary to express higher-order communications: input prefix, process output, and parallel composition.  ...  They also coincide with their asynchronous versions. A sound and complete axiomatization of bisimilarity is given.  ...  This research was initiated by some remarks and email exchange with Naoki Kobayashi.  ... 
doi:10.1109/lics.2008.8 dblp:conf/lics/LanesePSS08 fatcat:c2736otrnjfixftiu2ns65q6r4

On the expressiveness and decidability of higher-order process calculi

Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt
2011 Information and Computation  
A core calculus of higher-order concurrency is studied; it has only the operators necessary to express higher-order communications: input prefix, process output, and parallel composition.  ...  They also coincide with their asynchronous versions. A sound and complete axiomatization of bisimilarity is given.  ...  This research was initiated by some remarks and email exchange with Naoki Kobayashi.  ... 
doi:10.1016/j.ic.2010.10.001 fatcat:m2cam7szyzac7hd7hxwbd6a6mi

A parallel processing architecture for sensor-based control of intelligent mobile robots

Huosheng Hu, Michael Brady
1996 Robotics and Autonomous Systems  
This paper describes the design and implementation of a parallel processing architecture used for real-time, sensor-based control of mobile robots.  ...  Parallel processing plays an important role in sensor-based control of intelligent mobile robots.  ...  The design of a parallel processing architecture presented in this paper is heavily influenced by the need for real-time sensing~, control and decision-making in order for mobile robots to interact intelligently  ... 
doi:10.1016/0921-8890(95)00070-4 fatcat:hxgabkfhvbgr3enss62nr5gm5u

Security and Privacy Functionalities in IoT

Elahe Fazeldehkordi, Olaf Owe, Josef Noll
2019 2019 17th International Conference on Privacy, Security and Trust (PST)  
of concurrent, autonomous units communicating by message passing, where each unit can run on a device with limited processing power and limited storage.  ...  New distributed systems in computing technology are appearing on the market day by day. Consequently, new security and privacy challenges arise when designing these systems.  ...  the EU H2020 research and innovation programme.  ... 
doi:10.1109/pst47121.2019.8949054 dblp:conf/pst/FazeldehkordiON19 fatcat:x37vqxe35vdtdlo2xebg7beaoa

A Framework for Verifying Data-Centric Protocols [chapter]

Yuxin Deng, Stéphane Grumbach, Jean-François Monin
2011 Lecture Notes in Computer Science  
We consider as a case study tree protocols, and show how this framework enables us to formally verify them in both the asynchronous and synchronous setting.  ...  We consider a framework using an original formalization in the Coq proof assistant of a distributed computation model based on message passing with either synchronous or asynchronous behavior.  ...  Two of the languages developed, Estelle and SDL, are based on asynchronous communicating automata, while LOTOS is a process algebra based on CCS and CSP extended with algebraic data types [35] .  ... 
doi:10.1007/978-3-642-21461-5_7 fatcat:rsjc3gq6rndltdmxw4etxffsry

Mixing Metaphors: Actors as Channels and Channels as Actors

Simon Fowler, Sam Lindley, Philip Wadler, Marc Herbstritt
2017 European Conference on Object-Oriented Programming  
Hopac [28] is a channel-based library for F#, based on Concurrent ML [45].  ...  ACM Subject Classification D.1.3 Concurrent Programming a b c (a) Asynchronous Channels. A B C (b) Actors. Figure 1 Channels and Actors. for asynchronous channels.  ...  Thanks to Philipp Haller, Daniel Hillerström, Ian Stark, and the anonymous reviewers for detailed comments.  ... 
doi:10.4230/lipics.ecoop.2017.11 dblp:conf/ecoop/FowlerLW17 fatcat:5ifbvwbfyfcdvanbjsps3lrh34

Concurrent forward bounding for distributed constraint optimization problems

Arnon Netzer, Alon Grubshtein, Amnon Meisels
2012 Artificial Intelligence  
The new algorithm scans the search space by using multiple search processes (SPs) that run on all agents concurrently.  ...  The number of concurrent SPs is controlled dynamically by the ConcFB algorithm, by performing dynamic splitting.  ...  These values are computed concurrently and asynchronously, and responses are sent back to the originator of the request. This results in an asynchronous process of backwards costs propagation.  ... 
doi:10.1016/j.artint.2012.09.002 fatcat:dddmzbcwifblbjsop65hrhf7zu

On the Distributability of Mobile Ambients

Kirstin Peters, Uwe Nestmann
2018 Electronic Proceedings in Theoretical Computer Science  
Modern society is dependent on distributed software systems and to verify them different modelling languages such as mobile ambients were developed.  ...  Finally, we discuss how these results can be used to obtain a fully distributed variant of mobile ambients.  ...  Consequently, by extending the results of [22] , we place mobile ambients on the same level as the pi-calculus with separate choice (π s ) and the asynchronous pi-calculus (π a ) above J and below π m  ... 
doi:10.4204/eptcs.276.9 fatcat:u4x7uvwxwjbw5n6msivr6t6dge

The Join Calculus: A Language for Distributed Mobile Programming [chapter]

Cédric Fournet, Georges Gonthier
2002 Lecture Notes in Computer Science  
Formally, the language owes much to concurrency theory, which provides a strong basis for stating and proving the properties of asynchronous programs.  ...  We briefly present how the calculus has been extended to model distributed failures on the one hand, and cryptographic protocols on the other.  ...  Acknowledgements These lecture notes are partly derived from previous works in collaboration with Martín Abadi, Sylvain Conchon, Cosimo Laneve, Fabrice Le Fessant, Jean-Jacques Lévy, Luc Maranget, Didier Rémy, and  ... 
doi:10.1007/3-540-45699-6_6 fatcat:i2tobjoxlvhkzjbwitnec7ozca

Interactive foundations of computing

Peter Wegner
1998 Theoretical Computer Science  
Asynchronous and nonserializable interaction are shown to be more expressive than sequential interaction (multiple streams are more expressive than a single stream).  ...  Interaction machines extend the Chomsky hierarchy, are modeled by interaction grammars, and precisely capture fuzzy concepts like open systems and empirical computer science.  ...  Mobile processes support lazy binding to resources as they become dynamically available. 07 (lazy binding): Lazy interactive binding facilitates flexibility in interpreters, inheritance, and mobile processes  ... 
doi:10.1016/s0304-3975(97)00154-0 fatcat:jfv7xn5nlveqjagut2rkidjdem

Cellular Learning Automata With Multiple Learning Automata in Each Cell and Its Applications

H. Beigy, M.R. Meybodi
2010 IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)  
The cellular learning automata, which is a combination of cellular automata and learning automata, is introduced recently.  ...  Two applications of this new model such as channel assignment in cellular mobile networks and function optimization are also given.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their valuable comments and suggestions which improved the paper.  ... 
doi:10.1109/tsmcb.2009.2030786 pmid:19884061 fatcat:gktac2ivurhcfpehdjmlht3zri
« Previous Showing results 1 — 15 out of 1,407 results