Filters








17 Hits in 4.4 sec

Synchronizability of Communicating Finite State Machines is not Decidable [article]

Alain Finkel
2020 arXiv   pre-print
In this paper, we show that this small model property does not hold neither for mailbox communications, nor for peer-to-peer communications, therefore the decidability of synchronizability becomes an open  ...  We also show that, in this case, synchronizability implies the absence of unspecified receptions and orphan messages, and the channel-recognizability of the reachability set.  ...  We also thank Shrisha Rao for his carrefull reading of the paper.  ... 
arXiv:1702.07213v5 fatcat:wutrsd5tfvezndvm5c7epqvje4

On synchronized multi-tape and multi-head automata

Oscar H. Ibarra, Nicholas Q. Tran
2012 Theoretical Computer Science  
We obtain decidability and undecidability results for these devices for both one-way and two-way versions.  ...  We also consider the notion of k-synchronized one-way and two-way multi-head automata and investigate similar problems.  ...  Acknowledgments The authors thank Zhe Dang, Bala Ravikumar, and Fang Yu for helpful comments on this work.  ... 
doi:10.1016/j.tcs.2012.04.006 fatcat:gcyuf5gtoja6pannu4s6h34huy

On Synchronized Multitape and Multihead Automata [chapter]

Oscar H. Ibarra, Nicholas Q. Tran
2011 Lecture Notes in Computer Science  
We obtain decidability and undecidability results for these devices for both one-way and two-way versions.  ...  We also consider the notion of k-synchronized one-way and two-way multi-head automata and investigate similar problems.  ...  Acknowledgments The authors thank Zhe Dang, Bala Ravikumar, and Fang Yu for helpful comments on this work.  ... 
doi:10.1007/978-3-642-22600-7_15 fatcat:nblddg6jpfgsjigkrmviflfdjy

Towards Generalised Half-Duplex Systems

Cinzia Di Giusto, Loïc Germerie Guizouarn, Etienne Lozes
2021 Electronic Proceedings in Theoretical Computer Science  
They can be used for instance to model distributed protocols. Due to the unboundedness of the FIFO queues, several verification problems are undecidable for these systems.  ...  We show that greedy systems retain the same good properties as binary half-duplex systems, and that, in the setting of mailbox communications, greedy systems are quite closely related to a multiparty generalisation  ...  We would like to thank all the ICE reviewers for their comments that greatly improved the present paper.  ... 
doi:10.4204/eptcs.347.2 fatcat:7tblleyn5nhs5kyl3ikvvxoy2u

Synchronization and Control of Quantitative Systems [article]

Simon Laursen
2016 Ph.d.-serien for Det Teknisk-Naturvidenskabelige Fakultet, Aalborg Universitet  
This challenge creates the need for expressive and computationally feasible modeling and specification formalisms.  ...  However, formal modeling of software is not trivial, and the ever increasing demand for software functionality and the complexity of such software systems makes modeling even harder.  ...  We thank these institutions for their hospitality, and for the support by the DFG project TriCS (ZI 1516/1-1), the ERC Advanced Grant LASSO and the EU FET projects SENSATION and CASSTING.  ... 
doi:10.5278/vbn.phd.engsci.00182 fatcat:kftiafaw4fhf5lyrvqha7vaoce

Bounded Reachability Problems are Decidable in FIFO Machines [article]

Benedikt Bollig, Alain Finkel, Amrita Suresh
2022 arXiv   pre-print
In this paper, we provide an underapproximation for the general model by considering only runs that are input-bounded (i.e. the sequence of messages sent through a particular channel belongs to a given  ...  The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known.  ...  Reachability under this restriction and checking k-synchronizability are both PSPACE-complete [GLL20] .  ... 
arXiv:2105.06723v4 fatcat:dgcmbegbazbfjbril73oplu47q

Verifying UML-RT Protocol Conformance Using Model Checking [chapter]

Yann Moffett, Alain Beaulieu, Juergen Dingel
2011 Lecture Notes in Computer Science  
In this thesis, we study asynchronous communication: Each message channel is an unbounded, unordered, and lossless buffer [172, 134, 150] .  ...  Figure 2 illustrates the open systems notion. Next to interaction, compositionality is another first-class citizen for open systems: The composition of two open systems is again an open system.  ...  A marking m of a net N is m 1 t 1 − − → . . . t k − − → m k+1 is a run of N from m 1 to m k+1 , if for all 1 ≤ i ≤ k, m i t i −→ m i+1 ; for v = t 1 . . . t k , we also write m 1 v −→ m k+1 instead of  ... 
doi:10.1007/978-3-642-24485-8_30 fatcat:bc2xs3tctvflnlyika6uiwsmm4

Building the second generation of parallel/distributed virtual reality systems

Shaun Bangay, James Gain, Greg Watkins, Kevan Watkins
1997 Parallel Computing  
The approaches to parallel decomposition differ for each system, as do the performance implications of each approach.  ...  Performance measurement for a Virtual Reality system differs from that of other parallel systems in that some measure of the delays involved with the interaction of the separate c~mponents is required,  ...  Acknowledgements This work would not ~ave been possible without the resources of the Internet, and the assistance of members of the Internet community.  ... 
doi:10.1016/s0167-8191(97)00040-9 fatcat:txe7b7xatbcbpdxrolsn4rs6ky

Communication in concurrent dynamic logic

David Peleg
1987 Journal of computer and system sciences (Print)  
Communication mechanisms are introduced into the program schemes of Concurrent Dynamic Logic, on both the propositional and the first-order levels.  ...  In general, we find that both respects are dominated by the extent to which the capabilities of synchronization and (unbounded) counting are enabled in the communication scheme. 'i?  ...  The formula correspond,j employs two processes, one to "guess" and verify an x-partition of the word, and the other for the y-partition.  ... 
doi:10.1016/0022-0000(87)90035-3 fatcat:elhd7uafdvbrdlz52jruzrxf2u

Complex networks: Structure and dynamics

S BOCCALETTI, V LATORA, Y MORENO, M CHAVEZ, D HWANG
2006 Physics reports  
In real networks, the degree distribution P (k), defined as the probability that a node chosen uniformly at random has degree k or, equivalently, as the fraction of nodes in the graph having degree k,  ...  The first approach to capture the global properties of such systems is to model them as graphs whose nodes represent the dynamical units, and whose links stand for the interactions between them.  ...  Their sharing of very stimulating and fruitful discussions (or unpublished results on the subjects treated in this report) is largely responsible for our effort to provide a new account of this rapidly  ... 
doi:10.1016/j.physrep.2005.10.009 fatcat:us3vssqn6ngcxdi4ise2znlcdi

Aalborg Universitet Synchronization and Control of Quantitative Systems SYNCHRONIZATION AND CONTROL OF QUANTITATIVE SYSTEMS Synchronization and Control of Quantitative Systems

Simon Laursen, Simon Laursen, Dissertation Simon, Borgbjerg Laursen, Thomas Hildebrandt, Jean-Francois Raskin
unpublished
This challenge creates the need for expressive and computationally feasible modeling and specification formalisms.  ...  However, formal modeling of software is not trivial, and the ever increasing demand for software functionality and the complexity of such software systems makes modeling even harder.  ...  We thank these institutions for their hospitality, and for the support by the DFG project TriCS (ZI 1516/1-1), the ERC Advanced Grant LASSO and the EU FET projects SENSATION and CASSTING.  ... 
fatcat:w5amh6vebzb3pbwumpjnqcqg7a

Mean delay analysis for unidirectional broadcast structures

Joseph Wai Ming Pang
1985
Emphasis is placed on the analysis of mean delay-vs-throughput performance for the gated exhaustive service discipline under asymmetric traffic.  ...  A number of exact results are derived and based on these results, a very good approximation for the average delays is developed.  ...  for bit synchronization and the collisions mentioned above will not affect the synchronizability of the preamble portion.  ... 
doi:10.14288/1.0096210 fatcat:xrjnyvtrobd2tljmokiffyo5ky

Communication over channels with symbol synchronization errors

Hugues Mercier
2008
I improve on the best existing lower and upper bounds for the capacity of the deletion channel using convex and stochastic optimization techniques.  ...  Consequently, the capacity of channels subjected to synchronization errors is a very challenging problem, even when considering the simplest channels for which only deletion errors occur.  ...  either lost or dropped due to buffer overflow at finite-buffer queues.  ... 
doi:10.14288/1.0066430 fatcat:3dnheafmffamjfurbyed6vmccq

Correctness of services and their composition

Niels Lohmann
2010
We thereby focus on the communication protocol of the service and approach these questions using formal methods and make contributions to three scenarios of SOC.  ...  We study correctness of services and their composition and investigate how the design of correct service compositions can be systematically supported.  ...  If a service is k-controllable for a message bound k ∈ N + , it is also l-controllable for any bound l > k.  ... 
doi:10.18453/rosdok_id00000716 fatcat:fml7wl5dabawvpywktyg6rv5ca

27th Annual Computational Neuroscience Meeting (CNS*2018): Part One

2018 BMC Neuroscience  
Gutzen for fruitful discussions.  ...  Acknowledgements We acknowledge the Initiative and Networking Fund of the Helmholtz Association, the Helmholtz Association through the Helmholtz Portfolio Theme"Supercomputing and Modeling for the Human  ...  The Na+/K+ pump exchanges two K+ ions for three Na+ ions. Its current has a sigmoidal dependence on intracellular Na+ concentrations.  ... 
doi:10.1186/s12868-018-0452-x pmid:30373544 pmcid:PMC6205781 fatcat:xv7pgbp76zbdfksl545xof2vzy
« Previous Showing results 1 — 15 out of 17 results