Filters








83,821 Hits in 4.1 sec

Reachability of Communicating Timed Processes [article]

Lorenzo Clemente and Frédéric Herbreteau and Amélie Stainer and Grégoire Sutre
2012 arXiv   pre-print
We study the reachability problem for communicating timed processes, both in discrete and dense time.  ...  Our main contribution is a complete characterization of decidable and undecidable communication topologies, for both discrete and dense time.  ...  The reachability problem asks, given a system of communicating timed processes S, whether there exists a run in its semantics S .  ... 
arXiv:1209.0571v2 fatcat:tuu4y6duh5hhzaqbap4rkp4k3e

Reachability of Communicating Timed Processes [chapter]

Lorenzo Clemente, Frédéric Herbreteau, Amelie Stainer, Grégoire Sutre
2013 Lecture Notes in Computer Science  
We study the reachability problem for communicating timed processes, both in discrete and dense time.  ...  Our main contribution is a complete characterization of decidable and undecidable communication topologies, for both discrete and dense time.  ...  The reachability problem asks, given a system of communicating timed processes S, whether there exists a run in its semantics S .  ... 
doi:10.1007/978-3-642-37075-5_6 fatcat:nt2kzw7kkzgr7caf7oqa24infi

Specification, validation, and verification of time-critical systems

Shiuh-Pyng Shieh, Jun-Nan Chen
1998 Computer Communications  
Communicating finite state machine (CFSM) CFSM is a simple and commonly used representation of communication processes.  ...  A given time-dependent specification can be formalized as a Timed CFSM, from which the reachability graph is constructed to verify the correctness of the specification.  ...  Acknowledgements This work was supported in part by the National Science Council of Taiwan. under contract NSC 85-2213-E-009-032.  ... 
doi:10.1016/s0140-3664(97)00145-x fatcat:5ytepocptreazd2rgdqzkkdl54

Stochastic Reachability Analysis of Hybrid Systems [chapter]

Luminita Manuela Bujorianu
2012 Communications and Control Engineering  
The Case of a Stochastic Hybrid Process . . . . . . . . . . 114 6.4 Reachability Estimation via Martin Capacities . . . . . . . . . . . 115 6.4.1 Martin Capacity . . . . . . . . . . . . . . . . . . .  ...  Estimation via Transition Semigroup . . . . . . . . . 111 6.3.1 The Case of a Markov Chain . . . . . . . . . . . . . . . . 112 6.3.2 The Case of a Markov Process . . . . . . . . . . . . . . . 113 6.3.3  ... 
doi:10.1007/978-1-4471-2795-6_12 fatcat:2i4mvlzoszg6voroobblo36q2a

Group Communication in Partitionable Distributed Systems [chapter]

Özalp Babaoğlu, Renzo Davoli, Alberto Montresor
2000 Lecture Notes in Computer Science  
We give a formal specification and an implementation for a partitionable group communication service in asynchronous distributed systems.  ...  t, and (ii) a process that has not crashed by time t is reachable from itself at time t.  ...  p cannot communicate at time t.  ... 
doi:10.1007/3-540-46475-1_3 fatcat:4bnrpcpgcvhcrmpcoeej226rh4

Group communication in partitionable systems: specification and algorithms

O. Babaoglu, R. Davoli, A. Montresor
2001 IEEE Transactions on Software Engineering  
We give a formal specification and an implementation for a partitionable group communication service in asynchronous distributed systems.  ...  t, and (ii) a process that has not crashed by time t is reachable from itself at time t.  ...  p cannot communicate at time t.  ... 
doi:10.1109/32.917522 fatcat:3tzy33esnrczvb43nftkrgx4ha

Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits [chapter]

Tamir Heyman, Danny Geist, Orna Grumberg, Assaf Schuster
2000 Lecture Notes in Computer Science  
The algorithm uses a distributed termination protocol with none of the memory modules preserving a complete image of the set of reachable states.  ...  A corresponding decrease of space requirements is measured throughout the reachability analysis.  ...  Our method parallelizes symbolic reachability analysis on a network of processes with disjoint memory, that communicate via message passing.  ... 
doi:10.1007/10722167_6 fatcat:7prbmoifkrbepibrrr53htgwky

Reverse reachability analysis: A new technique for deadlock detection on communicating finite state machines

Yung-Chen Hung, Gen-Huey Chen
1993 Software, Practice & Experience  
If the initial global state can be reached during the process of reverse reachability analysis, then deadlock exists. Otherwise the communication system is deadlock-free.  ...  A global state of the communication system is defined as a combination of the states of co-operating processes and the contents of channels connecting them.  ...  Otherwise the communication system is reverse reachability analysis Figure 1 shows the communication system. Each process is represented as a CFSM.  ... 
doi:10.1002/spe.4380230904 fatcat:f5masp6pvjfcpevl6jlq4tqo24

Distributed Set Reachability

Sairam Gurajada, Martin Theobald
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
Moreover, analyzing dependencies among social-network communities inherently involves reachability checks between large sets of source and target vertices.  ...  Distributed set reachability has a plethora of applications in graph analytics and for query processing.  ...  The equivalence-sets optimization for Giraph ++ wEq further reduced the communication but only marginally improved the query processing times.  ... 
doi:10.1145/2882903.2915226 dblp:conf/sigmod/GurajadaT16 fatcat:ktc7ppqesnatbfv7677rhxgw64

A New Reachability Algorithm for Symmetric Multi-processor Architecture [chapter]

Debashis Sahoo, Jawahar Jain, Subramanian Iyer, David Dill
2005 Lecture Notes in Computer Science  
In this paper we present a novel parallel reachability approach that lead to a significantly faster verification on a Symmetric Multi-Processing architecture over the existing one-thread, one-CPU approaches  ...  A naive parallelization of such algorithms is often ineffective as they have less parallelism.  ...  Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.  ... 
doi:10.1007/11562948_5 fatcat:vh3c5n5cwvb6to7faiduf7rvdi

Privacy-Preserving Quantification of Cross-Domain Network Reachability

Fei Chen, Bruhadeshwar Bezawada, Alex X. Liu
2015 IEEE/ACM Transactions on Networking  
The experimental results show that the online processing time of an ACL containing thousands of rules is less than 25 s.  ...  Given two ACLs, each containing thousands of rules, the comparison time is less than 6 s, and the total communication cost is less than 2100 kB.  ...  The online processing time of an ACL with thousands of rules is less than 25 s, and the comparison time of two ACLs is less than 5 s.  ... 
doi:10.1109/tnet.2014.2320981 fatcat:xcasslj7frhxjfzrarapw2ejfy

Network reachability of real-world contact sequences

Petter Holme
2005 Physical Review E  
We conclude, among other things, that the network reachability depends much on a core where the path lengths are short and communication frequent, that clustering of the contacts of an edge in time tend  ...  to decrease the reachability, and that the order of the contacts really do make sense for dynamical spreading processes.  ...  ) and short-time dynamic processes.  ... 
doi:10.1103/physreve.71.046119 pmid:15903738 fatcat:24uycvrjercajebffosfpg5fau

Context-Bounded Analysis of Concurrent Queue Systems [chapter]

Salvatore La Torre, P. Madhusudan, Gennaro Parlato
2008 Lecture Notes in Computer Science  
We show that the bounded context-switching reachability problem for concurrent finite systems communicating using unbounded FIFO queues is decidable, where in each context a process reads from only one  ...  We then proceed to classify architectures that admit a decidable (unbounded context switching) reachability problem, using the decidability of bounded context switching.  ...  Two recent papers give us hope: in [18] , the authors addressed the reachability problem for asynchronous programs communicating via unbounded bags of messages using counter systems, and a year later,  ... 
doi:10.1007/978-3-540-78800-3_21 fatcat:7sa3ijlzqvft5ltank3szok7be

On the random walk method for protocol testing [chapter]

Milena Mihail, Christos H. Papadimitriou
1994 Lecture Notes in Computer Science  
small cover time property.  ...  Following West's original reasoning, efficient sampling of the reachable state space by random walk suffices to ensure effectiveness of testing.  ...  The aim of testing is to explore the reachable state space of the reachable state space of the combined automaton.  ... 
doi:10.1007/3-540-58179-0_49 fatcat:eln5zuyuibewld4gorwanpmjsi

Automatic Verification of Real-Time Communicating Systems by Constraint-Solving [chapter]

Wang Yi, Paul Pettersson, Mats Daniels
1995 IFIP Advances in Information and Communication Technology  
In this paper, an algebra of timed processes with real valued clocks is presented, which serves as a formal description language for real time communicating systems.  ...  The rest of the paper will be organized as follows: In section 2, we present an algebra of timed processes, in which a syntactical term describes a timed automaton; any timed automaton can be expressed  ...  We would also like to thank Bengt Asker and Ulf Olsson from the steering group of the Swedish Board for Technical Development NUTEK for supervising the project.  ... 
doi:10.1007/978-0-387-34878-0_18 fatcat:evm2ftyh2vg3llblbpr5sxmsva
« Previous Showing results 1 — 15 out of 83,821 results