A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Computing Strong/Weak Bisimulation Equivalences and Observation Congruence for Value-Passing Processes
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
Finally, the improved STGAs are generalized to both symbolic observation graphs with assignments and symbolic congruence graphs with assignments, and therefore weak bisimulation equivalence and observation ...
The rules which generate the improved STGAs from regular value-passing processes are presented. ...
/weak bisimulation equivalences and observation congruence for valuepassing processes. ...
doi:10.1007/3-540-49059-0_21
fatcat:spdgjhptebadpkyysnnz37rv6y
Encoding Asynchronous Interactions Using Open Petri Nets
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
We present an encoding for (bound) processes of the asynchronous CCS with replication into open Petri nets: ordinary Petri nets equipped with a distinguished set of open places. ...
The standard token game of nets models the reduction semantics of the calculus; the exchange of tokens on open places models the interactions between processes and their environment. ...
We are grateful to Barbara König for enlightening discussions on a preliminary version of this paper and to the anonymous reviewers for their inspiring comments. ...
doi:10.1007/978-3-642-04081-8_8
fatcat:d5fbbkhypjaitmjb6bk4os63ty
Process algebra for performance evaluation
2002
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The main emphasis of this paper is the treatment of operational semantics, notions of equivalence, and (sound and complete) axiomatisations of these equivalences for di erent types of Markovian process ...
Markovian process algebras like TIPP, PEPA and EMPA) and as separate entities (like in the timed process algebras timed CSP and TCCS). ...
Acknowledgements The remarkable level of todays stochastic process algebra research has only been possible, since scientists of both communities, theoretical computer science and performance evaluation ...
doi:10.1016/s0304-3975(00)00305-4
fatcat:uab7q45gs5c43ixjzujjthe3dy
On Reduction Semantics for the Push and Pull Ambient Calculus
[chapter]
2002
Foundations of Information Technology in the Era of Network and Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Honda and Yoshida showed how to obtain a meaningful equivalence on processes in the asynchronous 1r-calculus using equational theories identifying insensitive processes. ...
(eds.), Foundations of Information Technology in the Era of Network and Mobile Computing ...
Acknowledgments We would like to thank Martin Berger, Cedric Fournet, Andy Gordon, Philippa Gardner, Kohei Honda, Sergio Maffeis and Andrew Phillips for useful discussions. ...
doi:10.1007/978-0-387-35608-2_45
dblp:conf/ifipTCS/PhillipsV02
fatcat:d3qmdvvgongjjemscjbkrbwuce
Behavioural Theory at Work: Program Transformations in a Service-Centred Calculus
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
All transformations are specified in SSCCa process calculus for modelling and analysing service-oriented systems-and proved correct with respect to a suitable form of behavioural equivalence (full weak ...
Since the equivalence is proved to be compositional, results remain valid in arbitrary contexts. ...
Even if presenting a complete axiomatization for such a complex calculus is out of the scope of this paper, we present here some axioms (equational laws correct with respect to strong/weak full bisimilarity ...
doi:10.1007/978-3-540-68863-1_5
fatcat:sb5vphai4vhg7ijzplisj6j6ni
On reduction-based process semantics
1995
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A formulation of semantic theories for processes which does not rely on the notion of observables or convergence is studied. ...
The resulting theories in many cases coincide with, and sometimes generalise, observation-based formulation of behavioural equivalence. ...
Acknowledgments The authors thank Hendrik Barendregt, Gerald Berry, Cliff Jones, Robin Milner and Davide Sangiorgi for discussions. ...
doi:10.1016/0304-3975(95)00074-7
fatcat:dcuaexcqfnertjjeabrky4l2ba
On reduction-based process semantics
[chapter]
1993
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A formulation of semantic theories for processes which does not rely on the notion of observables or convergence is studied. ...
The resulting theories in many cases coincide with, and sometimes generalise, observation-based formulation of behavioural equivalence. ...
Acknowledgments The authors thank Hendrik Barendregt, Gerald Berry, Cliff Jones, Robin Milner and Davide Sangiorgi for discussions. ...
doi:10.1007/3-540-57529-4_70
fatcat:awvzy6bz3va3vfbf3lylvp7ofq
Time-Abstracted Bisimulation: Implicit Specifications and Decidability
1997
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce a time-abstracting (bisimulation) equivalence and investigate its properties with respect to the real-time process calculus of Wang (Real-time behaviour of asynchronous agents ...
In addition, a number of process equivalences sensitive to time-quantities have been proposed, among these the notion of timed (bisimulation) equivalence. ...
ACKNOWLEDGMENT We thank the anonymous referees for their constructive comments and suggestions. Received October 21, 1993; final manuscript received November 26, 1996 ...
doi:10.1006/inco.1997.2623
fatcat:jxqw4g6nt5aq7dzq2wzamjjbhi
Time abstracted bisimulation: Implicit specifications and decidability
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce a time-abstracting (bisimulation) equivalence and investigate its properties with respect to the real-time process calculus of Wang (Real-time behaviour of asynchronous agents ...
In addition, a number of process equivalences sensitive to time-quantities have been proposed, among these the notion of timed (bisimulation) equivalence. ...
ACKNOWLEDGMENT We thank the anonymous referees for their constructive comments and suggestions. Received October 21, 1993; final manuscript received November 26, 1996 ...
doi:10.1007/3-540-58027-1_8
fatcat:lovntjlrpvhpha6ydn2flnur2e
Probabilistic bisimulations for quantum processes
2007
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Modeling and reasoning about concurrent quantum systems is very important for both distributed quantum computing and quantum protocol verification. ...
It is a natural quantum extension of classical value-passing CCS which can deal with input and output of quantum states, and unitary transformations and measurements on quantum systems. ...
The authors thank the colleagues in the Quantum Computation and Quantum Information Research Group for useful discussion. This work was partially supported by the ...
doi:10.1016/j.ic.2007.08.002
fatcat:glz4jwxzufch7kbyl6zcbzzeuu
Page 5107 of Mathematical Reviews Vol. , Issue 2000g
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
5107
bisimulation equivalences and observation congruence are defined. ...
Finally algorithms for checking strong/weak early bisimulation equivalences and ob- servation congruence are presented together with their correctness proofs. ...
Probabilistic bisimulations for quantum processes
2007
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Modeling and reasoning about concurrent quantum systems is very important for both distributed quantum computing and quantum protocol verification. ...
It is a natural quantum extension of classical value-passing CCS which can deal with input and output of quantum states, and unitary transformations and measurements on quantum systems. ...
The authors thank the colleagues in the Quantum Computation and Quantum Information Research Group for useful discussion. This ...
doi:10.1016/j.ic.2007.08.001
fatcat:owm52hv4tff5nelv6m6hoedgx4
Norm Functions for Probabilistic Bisimulations with Delays
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The so obtained equivalences (called (strict) normed bisimulation equivalence) are strictly between strong and weak bisimulation equivalence a la LS89, SL94, SL95]. ...
Moreover, we brie y discuss other aspects such as the soundness for establishing linear time properties and compositiality. ...
Acknowledgements: The authors would like to thank Frits Vaandrager and Holger Hermanns for many helpful comments. ...
doi:10.1007/3-540-46432-8_1
fatcat:hi5ooc3tmzhv3hxrze6i4jldoe
Decidable Fragments of a Higher Order Calculus with Locations
2009
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We show that strong and weak barbed bisimilarity are undecidable for Homer. We then identify and compare two distinct subcalculi of Homer that both satisfy the semantic finite control property. ...
Homer is a higher order process calculus with locations. ...
Then p ↓ ϕ and p ⇓ ϕ are decidable.
Proposition 4. 25 25 Strong/weak barbed bisimilarity are undecidable for HFC −d Γ . ...
doi:10.1016/j.entcs.2009.06.016
fatcat:lhykti5dofc3rct24eu7gmsvf4
CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The paper then reviews the main features of Cadp 2010, including compilers for various formal specification languages, equivalence checkers, model checkers, performance evaluation tools, and parallel verification ...
Cadp (Construction and Analysis of Distributed Processes) is a comprehensive software toolbox that implements the results of concurrency theory. ...
Bisimulator implements seven equivalence relations (strong, weak, branching, τ * .a [13] , safety, trace, and weak trace) and their associated preorders, and is one of the richest on-the-fly equivalence ...
doi:10.1007/978-3-642-19835-9_33
fatcat:4fh2thknsfaergm37j6tgbncze
« Previous
Showing results 1 — 15 out of 36 results