Results 21 to 30 of about 1,184,149 (273)
Permission-Based Separation Logic for Message-Passing Concurrency [PDF]
Logical Methods in Computer Science, 2011 We develop local reasoning techniques for message passing concurrent programs based on ideas from separation logics and resource usage analysis. We extend processes with permission- resources and define a reduction semantics for this extended language ...
Adrian Francalanza +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
Game semantics for first-order logic [PDF]
Logical Methods in Computer Science, 2010 We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results.
Olivier Laurent
doaj +1 more source
Labelled transition systems as a Stone space [PDF]
Logical Methods in Computer Science, 2005 A fully abstract and universal domain model for modal transition systems and refinement is shown to be a maximal-points space model for the bisimulation quotient of labelled transition systems over a finite set of events.
Michael Huth
doaj +1 more source
Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems [PDF]
Logical Methods in Computer Science, 2008 Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue of probabilistic bisimilarity.
Franck van Breugel +2 more
doaj +1 more source
Effects of losartan treatment on cardiac autonomic control during volume loading in patients with DCM [PDF]
, 2000 This study evaluated the effect of angiotensin II receptor blockade on cardiac autonomic control adaptation and urine output in response to acute isotonic volume load in patients with idiopathic dilated cardiomyopathy (DCM) and asymptomatic to mildly ...
C. Apicella +7 more
core +1 more source
Semantics of Typed Lambda-Calculus with Constructors [PDF]
Logical Methods in Computer Science, 2011 We present a Curry-style second-order type system with union and intersection types for the lambda-calculus with constructors of Arbiser, Miquel and Rios, an extension of lambda-calculus with a pattern matching mechanism for variadic constructors.
Barbara Petit
doaj +1 more source
A Calculus for Timed Automata [PDF]
, 1996 A language for representing timed automata is introduced. Its semantics is defined in terms of timed automata. This language is complete in the sense that any timed automaton can be represented by a term in the language.
Brinksma, Hendrik, d' Argenio, P.R.
core +5 more sources
Conway games, algebraically and coalgebraically [PDF]
Logical Methods in Computer Science, 2011 Using coalgebraic methods, we extend Conway's theory of games to possibly non-terminating, i.e. non-wellfounded games (hypergames). We take the view that a play which goes on forever is a draw, and hence rather than focussing on winning strategies, we ...
Furio Honsell, Marina Lenisa
doaj +1 more source