Filters








799 Hits in 6.0 sec

Simulations Up-to and Canonical Preorders

David de Frutos Escrig, Carlos Gregorio Rodríguez
2007 Electronical Notes in Theoretical Computer Science  
In this paper we define simulations up-to a preorder and show how we can use them to provide a coinductive, simulation-like, characterization of semantic preorders for processes.  ...  An interesting but unexpected result is that, when built from an equivalence relation, the simulation up-to is a canonical preorder whose kernel is the given equivalence relation.  ...  Acknowledgements We would like to express our gratitude to Miguel Palomino for all his comments on a previous version of this paper.  ... 
doi:10.1016/j.entcs.2007.08.014 fatcat:gncifvcymvadndypvuwungymwe

Full Abstraction for PCF (extended abstract) [chapter]

Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan
1994 Lecture Notes in Computer Science  
uniquely specified up to isomorphism by these properties [Mil77] ).  ...  Equivalently, every recursive strategy is definable up to observational equivalence.  ...  We want to hook the strategies up so that Player's moves in B under σ get turned into Opponent's moves in B for τ , and vice versa.  ... 
doi:10.1007/3-540-57887-0_87 fatcat:lmhjsi5t4fevrjhhb6gzzp3tba

Domain Equations for Probabilistic Processes (Extended Abstract)

Christel Baier, Marta Kwiatkowska
1997 Electronical Notes in Theoretical Computer Science  
We s h o w that the domain-theoretic semantics is fully abstract with respect to the simulation preorder, and that the metric semantics is fully abstract with respect to bisimulation. ? J J Ĵ J J Ĵ  ...  We de ne operational notions of preorder and equivalence as probabilistic extensions of the simulation preorder and the bisimulation equivalence respectively.  ...  Acknowledgement We w ould like t o a c knowledge Achim Jung for suggesting improvements to the paper. 18 Baier and Kwiatkowska  ... 
doi:10.1016/s1571-0661(05)80465-7 fatcat:4kx5q565dfg6pdgbk5dsm2nv3u

Liveness of Communicating Transactions (Extended Abstract) [chapter]

Edsko de Vries, Vasileios Koutavas, Matthew Hennessy
2010 Lecture Notes in Computer Science  
We study liveness and safety in the context of CCS extended with communicating transactions, a construct we recently proposed to model automatic error recovery in distributed systems.  ...  We develop a sound and complete theory of fair-testing in terms of CCS-like tree failures and show that, compared to CCS, communicating transactions provide increased distinguishing power to the observer  ...  Canonical Tests We identify a class of canonical liveness tests that encode sufficient power to distinguish any processes P and Q for which P ∼live Q.  ... 
doi:10.1007/978-3-642-17164-2_27 fatcat:mdy3dnok3zbbpjwy5y4ix6etc4

Testing preorders for probabilistic processes can be characterized by simulations

Bengt Jonsson, Wang Yi
2002 Theoretical Computer Science  
To reason about probabilistic phenomena such as failures and randomization, we need to extend models and methods that have proven successful for nonprobabilistic systems to a probabilistic setting.  ...  There are several preorders that serve as criteria for reÿnement of an abstract transition system to a more concrete one.  ...  Larsen and Skou [17] obtain an analogy to our result that the probabilistic must-testing preorder is equivalent to refusal simulation.  ... 
doi:10.1016/s0304-3975(01)00044-5 fatcat:nnk73oz2infnzodwxrrvgckpei

How to Be Both Rich and Happy: Combining Quantitative and Qualitative Strategic Reasoning about Multi-Player Games (Extended Abstract)

Nils Bulling, Valentin Goranko
2013 Electronic Proceedings in Theoretical Computer Science  
and qualitative reasoning.  ...  We propose a logical framework combining a game-theoretic study of abilities of agents to achieve quantitative objectives in multi-player games by optimizing payoffs or preferences on outcomes with a logical  ...  Acknowledgements: We thank the anonymous referees for detailed and helpful comments and additional references.  ... 
doi:10.4204/eptcs.112.8 fatcat:hpx5eqshsnditohhw5d6eaf6x4

Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular

Aliaume Lopez, Alex Simpson, Michael Wagner
2018 Annual Conference for Computer Science Logic  
axiomatic) all determine the same canonical preorder.  ...  We propose three general approaches to specifying such preorders: (i) operational (ii) denotational, and (iii) axiomatic; coinciding with the three major styles of program semantics.  ...  Acknowledgements We thank Gordon Plotkin, Matija Pretnar and Niels Voorneveld for helpful discussions.  ... 
doi:10.4230/lipics.csl.2018.29 dblp:conf/csl/LopezS18 fatcat:wins7aui3bgvbkkwwv3hpp4z3e

(Bi)simulations up-to characterise process semantics

David de Frutos Escrig, Carlos Gregorio Rodríguez
2009 Information and Computation  
The relation between bisimulations up-to and simulations up-to allows us to find some new relations between the equivalences that define the semantics and the corresponding preorders.  ...  We define (bi)simulations up-to a preorder and show how we can use them to provide a coinductive, (bi)simulation-like, characterisation of semantic (equivalences) preorders for processes.  ...  We define simulations up-to and prove some results that characterise behaviour preorders with simulations up-to a preorder.  ... 
doi:10.1016/j.ic.2007.12.003 fatcat:jtgbwaht75cebfdh5tjy6td5yq

Lax Bialgebras and Up-To Techniques for Weak Bisimulations

Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot, Marc Herbstritt
2015 International Conference on Concurrency Theory  
Hence, to reach our goal, we extend our previously developed categorical framework to an ordered setting.  ...  Up-to techniques are useful tools for optimising proofs of behavioural equivalence of processes. Bisimulations up-to context can be safely used in any language specified by GSOS rules.  ...  With this more abstract approach, we can capture various interesting coinductive predicates other than strong bisimilarity, such as simulations [12] and weak bisimulations.  ... 
doi:10.4230/lipics.concur.2015.240 dblp:conf/concur/BonchiPPR15 fatcat:scfhrqbogzaqtfobw3ikz3at5a

Components as coalgebras: The refinement dimension

Sun Meng, Luís S. Barbosa
2006 Theoretical Computer Science  
This provides a basis to reason about (and transform) state-based software designs.  ...  In particular, it is shown how refinement can be applied to the development of the inequational subset of a calculus of generic software components.  ...  are also the same, up to the abstraction map.  ... 
doi:10.1016/j.tcs.2005.09.072 fatcat:ekqxeolgpnelfgyjguctwkp5um

Effectful Applicative Similarity for Call-by-Name Lambda Calculi

Ugo Dal Lago, Francesco Gavazzo, Ryo Tanaka
2017 Italian Conference on Theoretical Computer Science  
We prove this notion to be fully abstract whenever terms are evaluated in call-by-name order.  ...  There is a canonical way to extend a closed relation to an open one. Definition 14.  ...  It is easy to see that ciu is a preorder 7 and thus ( ciu ) H is a compatible preorder containing ciu . We extend Howe's construction to frame stacks as described in Figure 5 .  ... 
dblp:conf/ictcs/LagoGT17 fatcat:fdt22bvlhvhc7djd4g6jg23jhu

A linear-time branching-time perspective on interface automata

Walter Vogler, Gerald Lüttgen
2020 Acta Informatica  
on alternating simulation.  ...  We shed light onto the subtleties implied by IA's pruning of all behaviour that might lead a component to autonomously enter an error state, and investigate when exactly de Alfaro and Henzinger's restriction  ...  Acknowledgements We thank Ayleen Schinko and Simon Göhrle for their past contributions to a number of results presented in this article.  ... 
doi:10.1007/s00236-020-00369-4 fatcat:w7nv4gg37jdenbl4d3wfp2daeq

Lower and Upper Bounds in Zone Based Abstractions of Timed Automata [chapter]

Gerd Behrmann, Patricia Bouyer, Kim G. Larsen, Radek Pelánek
2004 Lecture Notes in Computer Science  
We show that by distinguishing maximal lower and upper bounds, significantly coarser abstractions can be obtained. We show soundness and completeness of the new abstractions w.r.t. reachability.  ...  For verification purposes, one usually uses zone based abstractions w.r.t. the maximal constants to which clocks of the timed automaton are compared.  ...  We propose to replace it with the following LU-Canonize operator. proc LU-Canonize(D) for k ∈ Low ∩ Up do for i ∈ Low do for j ∈ Up do if (c ij , ≺ ij ) > (c ik , ≺ ik ) + (c kj , ≺ kj ) then (c ij , ≺  ... 
doi:10.1007/978-3-540-24730-2_25 fatcat:abtoowmzsfhezpx7jxz3oq6v4q

Weighted Branching Preorders and Distances: Logical Characterization and Complexity

Louise Foshammer, Kim Larsen, Radu Mardare, Bingtian Xue
unpublished
The resulting existential and universal simulation relations are decidable in polynomial time.  ...  This leads us to investigating two fragments of this logic allowing only upper bounds and either existential or universal quantification.  ...  Another important issue has been identification of behavioral preorders and equivalences that permit internal activities of processes to be abstracted away.  ... 
fatcat:i5h6zy6mpjfzpb2w2gqml3rnsa

Lower and upper bounds in zone-based abstractions of timed automata

Gerd Behrmann, Patricia Bouyer, Kim G. Larsen, Radek Pelánek
2005 International Journal on Software Tools for Technology Transfer (STTT)  
We show that by distinguishing maximal lower and upper bounds, significantly coarser abstractions can be obtained. We show soundness and completeness of the new abstractions w.r.t. reachability.  ...  For verification purposes, one usually uses zone based abstractions w.r.t. the maximal constants to which clocks of the timed automaton are compared.  ...  We propose to replace it with the following LU-Canonize operator. proc LU-Canonize(D) for k ∈ Low ∩ Up do for i ∈ Low do for j ∈ Up do if (c ij , ≺ ij ) > (c ik , ≺ ik ) + (c kj , ≺ kj ) then (c ij , ≺  ... 
doi:10.1007/s10009-005-0190-0 fatcat:rkchr733uneurkoj7xtr6ecmfe
« Previous Showing results 1 — 15 out of 799 results