Filters








21,940 Hits in 5.3 sec

Trace and Testing Equivalence on Asynchronous Processes

Michele Boreale, Rocco De Nicola, Rosario Pugliese
2002 Information and Computation  
We study trace and may-testing equivalences in the asynchronous versions of CCS and -calculus.  ...  The results throw light on the di erence between synchronous and asynchronous communication and on the weaker testing power of asynchronous observations.  ...  The anonymous referees of FoSSaCS'98 and FoSSaCS'99 provided valuable suggestions. Thanks to Marco Pistore for spotting an error in a previous version of the paper.  ... 
doi:10.1006/inco.2001.3080 fatcat:ihj4fa27wfbf5l7zsjcj7injda

A Theory of "May" Testing for Asynchronous Languages [chapter]

Michele Boreale, Rocco De Nicola, Rosario Pugliese
1999 Lecture Notes in Computer Science  
We study may testing equivalence focusing on the asynchronous versions of CCS and -calculus.  ...  The results throw l i g h t on the di erences between synchronous and asynchronous systems and on the weaker testing power of asynchronous observations.  ...  The intended equivalence is here the one induced by m a y testing: a process may pass a`test' performed by an external observer if and only if the other process may.  ... 
doi:10.1007/3-540-49019-1_12 fatcat:qyxcsdvjbzcivoawsoehkl7y3m

Trace Semantics is Fully Abstract

Sumit Nain, Moshe Y. Vardi
2009 2009 24th Annual IEEE Symposium on Logic In Computer Science  
Here we consider two extensions of the earlier model: probabilistic transducers and asynchronous transducers. We show that in both cases trace semantics is fully abstract.  ...  In this work we examine the branching-linear issue from the perspective of process equivalence, which is one of the most fundamental concepts in concurrency theory, as defining a notion of equivalence  ...  In principle, the same idea applies to processes: two processes are equivalent if they pass the same tests, but there is no agreement on what a test is and on what it means to pass a test.  ... 
doi:10.1109/lics.2009.12 dblp:conf/lics/NainV09 fatcat:kd4tnrduxbga7gcfravcbqditu

An Executable Specification of Asynchronous Pi-Calculus Semantics and May Testing in Maude 2.0

Prasanna Thati, Koushik Sen, Narciso Martí-Oliet
2004 Electronical Notes in Theoretical Computer Science  
We also present an executable specification of the may testing equivalence on non-recursive asynchronous π-calculus processes, using the Maude metalevel.  ...  Specifically, we describe our use of the metaSearch operation to both calculate the set of all finite traces of a non-recursive process, and to compare the trace sets of two processes according to a preorder  ...  for Adaptive System Interoperability, and the Spanish CICYT project Desarrollo Formal de Sistemas Basados en Agentes Móviles (TIC2000-0701-C02-01).  ... 
doi:10.1016/s1571-0661(05)82539-3 fatcat:7hcogzp6f5akthcomvqn2q4bna

A Fresh Look at Testing for Asynchronous Communication [chapter]

Puneet Bhateja, Paul Gastin, Madhavan Mukund
2006 Lecture Notes in Computer Science  
We propose two notions of test equivalence: one which corresponds to presenting all test inputs up front and the other which corresponds to interactively feeding inputs to the system under test.  ...  Later papers have considered testing equivalence for process algebras with asynchronous communication [4, 2] . In these approaches, there are no explicit channels between processes.  ...  We define two testing equivalences on asynchronous systems, corresponding to IO-behaviours and block observations.  ... 
doi:10.1007/11901914_28 fatcat:f4xaw4nke5ckva2xpu7jl36osm

Asynchronous Observations of Processes [chapter]

Michele Boreale, Rocco De Nicola, Rosario Pugliese
1998 Lecture Notes in Computer Science  
We study may and must testing-based preorders in an asynchronous setting.  ...  These characterizations throw light on the asymmetry between input and output actions in asynchronous interactions and on the difference between synchrony and asynchrony.  ...  We are grateful to the Dipartimento di Scienze dell'Informazione of Universit~ di Roma "La Sapienza" and to Istituto di Elaborazione deU'Informazione in Pisa for making our collaboration possible.  ... 
doi:10.1007/bfb0053544 fatcat:juqcddndwzaenmp7yisrkesfw4

Multiple Synchrony in MSC

Flávia Falcão, Juliano Iyoda, Augusto Sampaio
2009 Electronical Notes in Theoretical Computer Science  
We present a transformation algorithm that takes as input a diagram in the extended MSC and generates an equivalent one in the standard MSC.  ...  We propose an extension to Message Sequence Charts (MSC); MSC diagrams comprise processes (called instances) and messages. Messages in MSC are either asynchronous or method calls.  ...  Two processes P and Q are equivalent in the traces model whenever P T Q and Q T P . There are other models of CSP which are more elaborate than the traces model.  ... 
doi:10.1016/j.entcs.2009.05.050 fatcat:ewvfxuydmfhdthu6r6ilsx6tle

Faster asynchronous systems

Walter Vogler
2003 Information and Computation  
A testing scenario in the sense of De Nicola and Hennessy is developed to measure the worst-case efficiency of asynchronous systems.  ...  The resulting testing-preorder is characterized with a variant of refusal traces and shown to satisfy some properties that make it attractive as a faster-than relation.  ...  Fig. 18 shows a + b, the choice between a and b, on the left and (τ ∅ a) + b on the right; while a and τ ∅ a are ART-and MRT-equivalent, only a + b has ∅b as asynchronous and as m-refusal trace.  ... 
doi:10.1016/s0890-5401(03)00065-8 fatcat:epjosjmdjrfrzonebhucrvvnxa

A CSP model with flexible parallel termination semantics

Paul Howells, Mark d'Inverno
2008 Formal Aspects of Computing  
In addition, the authors would like to thank the anonymous referees for their suggestions and comments regarding the contents and structure of the paper.  ...  Acknowledgments The authors gratefully acknowledge the advice and assistance of the following people Richard Bornat, Jonathan Bowen, Peter Burton, Michael Luck, Steve Reeves, Steve Schneider and Steve  ...  the following process equivalence holds: ((a → SKIP)|||SKIP); R ≡ ((a → R) R) R (6) This equivalence indicates that in fact the test process is equivalent to one which is a pure non-deterministic choice  ... 
doi:10.1007/s00165-008-0098-z fatcat:dw4iq67p3zeu5nllz2hoisxshy

Automated verification of automata communicating via FIFO and bag buffers

Lakhdar Akroun, Gwen Salaün
2017 Formal methods in system design  
We also study various equivalence notions used for comparing the bounded asynchronous systems.  ...  This enables one to check temporal properties on the system for that bound and this ensures that the system will preserve them whatever larger bounds are used for buffers.  ...  Since two deterministic transition systems are strongly equivalent iff they are trace equivalent, then testing stability is undecidable for trace equivalence too.  ... 
doi:10.1007/s10703-017-0285-8 fatcat:jg5ktxpj2rc5vlcjbhcp4afgky

Categorical Structure of Asynchrony

Peter Selinger
1999 Electronical Notes in Theoretical Computer Science  
A category of asynchronous processes In this section, we describe a category of asynchronous labeled transition systems.  ...  morphism is total and the focus is equivalent to a category of complete partial orders.  ...  On the one hand, this equivalence should capture our intuition about what it means for two processes to be observationally equivalent.  ... 
doi:10.1016/s1571-0661(04)80073-2 fatcat:huz3xocq2vew5lm3kroexlvgoi

Verifying and Testing Asynchronous Circuits Using Lotos [chapter]

Ji He, Kenneth J. Turner
2000 IFIP Advances in Information and Communication Technology  
An algorithm is also presented for generating and applying implementation tests based on a specification. Tools have been developed for automated verification of conformance and generation of tests.  ...  It is shown how DILL (Digital Logic in LOTOS) can be used to specify, verify and test asynchronous hardware designs.  ...  The authors' TestGen tool produces a single test case of length 28 for the FIFO: gives its LTS (minimised with respect to observational equivalence), the suspension automaton of the LTS, and one of the  ... 
doi:10.1007/978-0-387-35533-7_17 fatcat:4jy7uxlrnngz3e2gk7ob6raw3q

Synthesis of Distributed Algorithms Using Asynchronous Automata [chapter]

Alin Ştefănescu, Javier Esparza, Anca Muscholl
2003 Lecture Notes in Computer Science  
We use safe asynchronous automata as implementation model, and characterise the languages they accept. We analyze the complexity of the synthesis problem in our framework.  ...  We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems.  ...  We thank Volker Diekert, Rémi Morin, Madhavan Mukund, Holger Petersen, and several anonymous referees for useful comments. This work was partially supported by EPSRC grant GR64322/01.  ... 
doi:10.1007/978-3-540-45187-7_2 fatcat:cvfk2mws45dyzga6vshs76545y

Model Testing Asynchronously Communicating Objects using Modulo AC Rewriting

Olaf Owe, Martin Steffen, Arild B. Torjusen
2010 Electronical Notes in Theoretical Computer Science  
Due to the asynchronous nature of communication, testing should be done up-to observational equivalence. This leads to a large increase in the reachable state space for the test cases.  ...  Testing and verification of asynchronously communicating objects in open environments are challenging due to non-determinism.  ...  Acknowledgement We thank Rudolf Schlatte for insight into application testing with Creol, and the anonymous referees for constructive criticism and hints to related work.  ... 
doi:10.1016/j.entcs.2010.12.015 fatcat:bcm7pid7wjclzkcuc4uwxpjmi4

Synchronizability for Verification of Asynchronously Communicating Systems [chapter]

Samik Basu, Tevfik Bultan, Meriem Ouederni
2012 Lecture Notes in Computer Science  
Since both synchronous and 1-bounded asynchronous versions of a system have finite state space, the equivalence check of their behavior, and therefore, synchronizability check, can be done automatically  ...  Hence, if a system is synchronizable, then the verification of these reachability properties can be done on the synchronous version of the system and the results hold for the asynchronous case.  ...  The authors thank Gwen Salaün for fruitful discussions on the CADP implementation.  ... 
doi:10.1007/978-3-642-27940-9_5 fatcat:4ot4rt5aj5e5blg44rlrd4bvua
« Previous Showing results 1 — 15 out of 21,940 results