Results 21 to 30 of about 1,319,448 (268)
A robust graph-based approach to observational equivalence [PDF]
Logical Methods in Computer ScienceWe propose a new step-wise approach to proving observational equivalence, and in particular reasoning about fragility of observational equivalence. Our approach is based on what we call local reasoning.
Dan R. Ghica +2 more
doaj +1 more source
Coalgebraic Automata Theory: Basic Results [PDF]
Logical Methods in Computer Science, 2008 We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves weak pullbacks.
C. Kupke, Y. Venema
doaj +1 more source
Event Structures for Petri nets with Persistence [PDF]
Logical Methods in Computer Science, 2018 Event structures are a well-accepted model of concurrency. In a seminal paper by Nielsen, Plotkin and Winskel, they are used to establish a bridge between the theory of domains and the approach to concurrency proposed by Petri.
Paolo Baldan +5 more
doaj +1 more source
Towards Inclusive Teacher Education: Sensitising individuals to how they learn [PDF]
, 2006 Higher Education has struggled to acknowledge and translate into better teaching and learning practices that sizeable literature base suggesting a link between cognitive style, learning preferences and performance.
Evans, Carol, Waring, Michael
core +2 more sources
Algebraic Notions of Termination [PDF]
Logical Methods in Computer Science, 2011 Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation.
Desharnais Jules +2 more
doaj +1 more source
Psi-calculi: a framework for mobile processes with nominal data and logic [PDF]
Logical Methods in Computer Science, 2011 The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processes and their names can be statically scoped as in the standard pi-calculus.
Jesper Bengtson +3 more
doaj +1 more source
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence [PDF]
Logical Methods in Computer Science, 2020 We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of nil, action prefix, choice, and the recursion construct.
Rob van Glabbeek +2 more
doaj +1 more source
Ordering and order-disorder phase transition in the (1x1) monolayer chemisorbed on the (111) face of an fcc crystal [PDF]
, 2016 In this paper we have considered a simple lattice gas model of chemisorbed monolayer which allows for the harmonic fluctuations of the bond length between the adsorbate atom and the surface site.
Patrykiejew, A., Staszewski, T.
core +3 more sources
Knowledge-Based Synthesis of Distributed Systems Using Event Structures [PDF]
Logical Methods in Computer Science, 2011 To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification exists. This process is particularly effective if the specifications are written in a
Mark Bickford +3 more
doaj +1 more source
Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended version) [PDF]
Logical Methods in Computer Science, 2017 We show that a version of Martin-L\"of type theory with an extensional identity type former I, a unit type N1 , Sigma-types, Pi-types, and a base type is a free category with families (supporting these type formers) both in a 1- and a 2-categorical sense.
Simon Castellan +2 more
doaj +1 more source