The algorithmics of bisimilarity

Aceto, Luca; Ingólfsdóttir, Anna; Srba, Jǐŕı

doi:10.1017/cbo9780511792588.004

Cited by 20 publications

(33 citation statements)

References 127 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The corresponding minimisation problem for deterministic automata is solved by means of the equality of the languages recognised from the states. Other known algorithms are available to identify bisimilarity and so to construct this image into the final automaton, like state partition algorithms (see, for instance, [1]). …”

Section: Discussion and Future Workmentioning

confidence: 99%

A description based on languages of the final non-deterministic automaton

Ballester‐Bolinches

Llópez

Esteban‐Romero

2014

Theoretical Computer Science

View full text Add to dashboard Cite

Section: Discussion and Future Workmentioning

confidence: 99%

A description based on languages of the final non-deterministic automaton

Ballester‐Bolinches

Llópez

Esteban‐Romero

2014

Theoretical Computer Science

View full text Add to dashboard Cite

“…In this case, D A final remark is about the computational complexity of the discovery algorithm. Determining is EXPTIME-complete in the size of the contracts [1], which has to be multiplied by the number of -checks (to find a compliant service in the repository) to obtain the overall cost.…”

Section: Service Discovery and Dual Contractsmentioning

confidence: 99%

An algebraic theory for web service contracts

Laneve

Padovani

2015

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. We study a natural notion of compliance between clients and services in terms of their bpel (abstract) descriptions. The induced preorder shows interesting connections with the must preorder and has normal form representatives that are parallel-free finite-state activities, called contracts. The preorder also admits the notion of least service contract that is compliant with a client contract, called principal dual contract. Our framework serves as a foundation of Web service technologies for connecting abstract and concrete service definitions and for service discovery.

show abstract

“…Following [16] the reduction of the problem of deciding ≈ sb to the problem of deciding ∼ sb is obtained by adding some additional transitions, so called weak transitions, to the LTS. Given two configurations γ and γ , the first step is to build G = LTS −→ (IS) where IS = {γ , γ }.…”

Section: Weak Equivalencementioning

confidence: 99%

“…Usually weak bisimilarity is computed by first closing the transition relation with respect to internal transitions and then by checking strong bisimilarity on the obtained LTS. In [7], this approach (which is referred in [16] as saturation) is proven to be unsound for CCP (see [7]). It is also shown that in order to obtain a sound algorithm, one has to close the transition relation, not only w.r.t.…”

mentioning

confidence: 99%

Efficient algorithms for program equivalence for confluent concurrent constraint programming

Pino

Bonchi

Valencia

2015

Science of Computer Programming

View full text Add to dashboard Cite

Concurrent Constraint Programming (CCP) is a well-established declarative framework from concurrency theory. Its foundations and principles e.g., semantics, proof systems, axiomatizations, have been thoroughly studied for over the last two decades. In contrast, the development of algorithms and automatic verification procedures for CCP have hitherto been far too little considered. To the best of our knowledge there is only one existing verification algorithm for the standard notion of CCP program (observational) equivalence. In this paper we first show that this verification algorithm has an exponential-time complexity even for programs from a representative sub-language of CCP; the summation-free fragment (CCP\+). We then significantly improve on the complexity of this algorithm by providing two alternative polynomial-time decision procedures for CCP\+ program equivalence. Each of these two procedures has an advantage over the other. One has a better time complexity. The other can be easily adapted for the full language of CCP to produce significant state space reductions. The relevance of both procedures derives from the importance of CCP\+. This fragment, which has been the subject of many theoretical studies, has strong ties to first-order logic and an elegant denotational semantics, and it can be used to model real-world situations. Its most distinctive feature is that of confluence, a property we exploit to obtain our polynomial procedures. Finally, we also study the congruence issues regarding CCP's program equivalence

show abstract

The algorithmics of bisimilarity

Cited by 20 publications

References 127 publications

A description based on languages of the final non-deterministic automaton

A description based on languages of the final non-deterministic automaton

An algebraic theory for web service contracts

Efficient algorithms for program equivalence for confluent concurrent constraint programming

Contact Info

Product

Resources

About