Filters








31 Hits in 2.8 sec

Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations [chapter]

Luca Aceto, Ignacio Fábregas, David de Frutos Escrig, Anna Ingólfsdóttir, Miguel Palomino
2012 Lecture Notes in Computer Science  
It is shown that there are mutual translations between modal transition systems and labelled transition systems that preserve, and reflect, refinement and the covariant-contravariant simulation preorder  ...  This paper studies the relationships between three notions of behavioural preorder that have been proposed in the literature: refinement over modal transition systems, and the covariant-contravariant simulation  ...  We shall present some indications that the partial bisimulation framework is strictly less expressive than both modal refinements and covariant-contravariant simulations.  ... 
doi:10.1007/978-3-642-29320-7_18 fatcat:mttjpfiujnaqpnyoxfccwr4tfu

On the specification of modal systems: A comparison of three frameworks

Luca Aceto, Ignacio Fábregas, David de Frutos-Escrig, Anna Ingólfsdóttir, Miguel Palomino
2013 Science of Computer Programming  
It is shown that there are mutual translations between modal transition systems and labelled transition systems that preserve, and reflect, refinement and the covariant-contravariant simulation preorder  ...  This paper studies the relationships between three notions of behavioural preorder that have been proposed in the literature: refinement over modal transition systems, and the covariant-contravariant simulation  ...  We shall present some indications that the partial bisimulation framework is strictly less expressive than both modal refinements and covariant-contravariant simulations.  ... 
doi:10.1016/j.scico.2013.02.004 fatcat:tfpjtrqcxvcrrifqg4ypm3vlqu

Graphical representation of covariant-contravariant modal formulae

Luca Aceto, Ignacio Fábregas, David de Frutos-Escrig, Anna Ingólfsdóttir, Miguel Palomino
2011 Electronic Proceedings in Theoretical Computer Science  
Covariant-contravariant simulation is a combination of standard (covariant) simulation, its contravariant counterpart and bisimulation.  ...  We show in this paper that the formulae from the covariant-contravariant modal logic that admit a "graphical" representation by means of processes, modulo the covariant-contravariant simulation preorder  ...  Acknowledgement The authors would like to thank the anonymous referees for their comments and suggestions. Reflection and Preservation of Properties in Coalgebraic (bi)Simulations  ... 
doi:10.4204/eptcs.64.1 fatcat:tughygyofjappe325d3jtfpibq

Modal Process Rewrite Systems [chapter]

Nikola Beneš, Jan Křetínský
2012 Lecture Notes in Computer Science  
In particular, we extend process rewrite systems to the modal setting and investigate decidability of the modal refinement relation between systems from various subclasses.  ...  Since already simulation is undecidable for most of the cases, we focus on the case where either the refined or the refining process is finite.  ...  The graphical representability of a variant of alternating simulation called covariant-contravariant simulation has been recently studied in [AFdFE + 11].  ... 
doi:10.1007/978-3-642-32943-2_9 fatcat:cctit65bwbcadctxkuz6l5fvhm

A Junction Between State Based and Behavioural Specification [chapter]

H. Bowman, J. Derrick
1999 Formal Methods for Open Object-Based Distributed Systems  
In particular, we present a testing characterisation of downward simulation, which is the standard state based refinement relation and is also closely related to subtyping.  ...  for relating state based and behavioural specification paradigms.  ...  like to acknowledgement the contribution of these collaborators, we mention in particular, Eerke Boiten, Charles Briscoe-Smith, Tommaso Bolognesi, Peter Linington, Tim Regan, Graeme Smith, Maarten Steen and  ... 
doi:10.1007/978-0-387-35562-7_18 fatcat:4fqbndheevhrtn4uphcxkrxgym

Saving Time in a Space-Efficient Simulation Algorithm

J. Markovski
2011 2011 11th International Conference on Quality Software  
We present an efficient algorithm for computing the simulation preorder and equivalence for labeled transition systems.  ...  The algorithm improves an existing space-efficient algorithm and improves its time complexity by employing a variant of the stability condition and exploiting properties of the underlying relations and  ...  Furthermore, the algorithm can also serve as basis for computing minimization with respect to so-called covariant-contravariant simulations, which have recently been shown related to the notion of modal  ... 
doi:10.1109/qsic.2011.26 dblp:conf/qsic/Markovski11 fatcat:qaxgnvuzzvadzbrabnymgshzcm

On Refinements of Boolean and Parametric Modal Transition Systems [article]

Jan Křetínský, Salomon Sickert
2013 arXiv   pre-print
Finally, we investigate the relationship between modal and thorough refinement on the two classes and show how the thorough refinement can be approximated by the modal refinement.  ...  We consider the extensions of modal transition systems (MTS), namely Boolean MTS and parametric MTS and we investigate the refinement problems over both classes.  ...  The graphical representability of a variant of alternating simulation called covariant-contravariant simulation has been recently studied in [AFdFE + 11].  ... 
arXiv:1304.5278v1 fatcat:ofe4fda5ynebbdw6gfmv4ozknm

On Refinements of Boolean and Parametric Modal Transition Systems [chapter]

Jan Křetínský, Salomon Sickert
2013 Lecture Notes in Computer Science  
Finally, we investigate the relationship between modal and thorough refinement on the two classes and show how the thorough refinement can be approximated by the modal refinement.  ...  We consider the extensions of modal transition systems (MTS), namely Boolean MTS and parametric MTS and we investigate the refinement problems over both classes.  ...  The graphical representability of a variant of alternating simulation called covariant-contravariant simulation has been recently studied in [AFdFE + 11].  ... 
doi:10.1007/978-3-642-39718-9_13 fatcat:3hvqc64bcbbknfzwry3vbeuaqu

Structural operational semantics for non-deterministic processes with quantitative aspects

Marino Miculan, Marco Peressotti
2016 Theoretical Computer Science  
This format, hence called Weight Function GSOS (WF-GSOS), covers many known systems and their bisimulations (e.g. PEPA, TIPP, PCSP) and GSOS formats (e.g. GSOS, Weighted GSOS, Segala-GSOS).  ...  First, we present a general GSOS specification format and a corresponding notion of bisimulation for non-deterministic processes with quantitative aspects.  ...  This work is partially supported by MIUR PRIN project 2010LHT4KM, CINA.  ... 
doi:10.1016/j.tcs.2016.01.012 fatcat:umbpuz2jmjbd7k6t5d3w46ieiq

Structural operational semantics for non-deterministic processes with quantitative aspects [article]

Marino Miculan, Marco Peressotti
2015 arXiv   pre-print
This format, hence called Weight Function GSOS (WF-GSOS), covers many known systems and their bisimulations (e.g. PEPA, TIPP, PCSP) and GSOS formats (e.g.  ...  First, we present a general GSOS specification format and a corresponding notion of bisimulation for non-deterministic processes with quantitative aspects.  ...  This work is partially supported by MIUR PRIN project 2010LHT4KM, CINA.  ... 
arXiv:1410.0893v2 fatcat:2jzlgliz4nhx3irs2xu5e4cr6i

Categories and all that -- A Tutorial [article]

Ernst-Erich Doberkat
2014 arXiv   pre-print
Coalgebras are discussed and applied to the semantics of modal logics, giving a brief introduction to coalgebraic logics as well.  ...  interplay between algebras, adjunctions and monads.  ...  . , ψ k ∈ v 0 , from which we obtain with (G) and (K) that ⊢ Λ ✷(ψ 1 ∧ · · · ∧ ψ k ) → ✷¬ϕ. Because ✷ψ 1 ∧ · · · ∧ ✷ψ k → ✷(ψ 1 ∧ · · · ∧ ψ k ), this implies ⊢ Λ ✷ψ 1 ∧ · · · ∧ ✷ψ k → ✷¬ϕ.  ... 
arXiv:1403.7760v2 fatcat:ziw5xxc2cvc5pbgfkro4jia74m

Refinement checking on parametric modal transition systems

Nikola Beneš, Jan Křetínský, Kim G. Larsen, Mikael H. Møller, Salomon Sickert, Jiří Srba
2015 Acta Informatica  
We investigate the computational complexity of modal and thorough refinement checking on PMTS and its subclasses and provide a direct encoding of the modal refinement problem into quantified Boolean formulae  ...  , allowing us to employ state-of-the-art QBF solvers for modal refinement checking.  ...  The graphical representability of a variant of alternating simulation called covariant-contravariant simulation has been recently studied in [1] .  ... 
doi:10.1007/s00236-015-0215-4 fatcat:hpgdri5bgrbspkh6ktom62f7si

Universal Decision Models [article]

Sridhar Mahadevan
2021 arXiv   pre-print
Bisimulation morphisms map between decision objects that capture structure-preserving abstractions.  ...  trial and error.  ...  Our goal is to construct covariant and contravariant functorial representations of intrinsic models.  ... 
arXiv:2110.15431v1 fatcat:2fwnguplrnfxxgtvh5uryc5q4a

Session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols [chapter]

Alex C. Keizer, Henning Basold, Jorge A. Pérez
2021 Lecture Notes in Computer Science  
As a result, we rediscover type equivalence, duality, and subtyping relations in terms of canonical coinductive presentations.  ...  Going full circle, we exhibit a coalgebra structure on an existing session type system, and show that the relations and type system resulting from our coalgebraic perspective agree with the existing ones  ...  As a first step, we will define three relations on states: bisimulation, duality, and simulation.  ... 
doi:10.1007/978-3-030-72019-3_14 fatcat:dphvrbf36nfcbi46v267dnxibm

6 Algebras and coalgebras [chapter]

Yde Venema
2007 Studies in Logic and Practical Reasoning  
In the second and last part of the chapter we describe how modal logic, and its model theory, provides many natural manifestations of the more general theory of universal coalgebra. 1 This text has been  ...  written as a chapter for the Handbook of Modal Logic (to appear), edited by Johan van Benthem, Patrick Blackburn and Frank Wolter.  ...  G is refined if it is both differentiated and tight, and descriptive if it is both refined and compact.  ... 
doi:10.1016/s1570-2464(07)80009-7 fatcat:e77uebqxdferlcg2nlfe5hobpq
« Previous Showing results 1 — 15 out of 31 results