Results 11 to 20 of about 1,138,378 (107)
Failure Trace Semantics for a Process Algebra with Time-outs [PDF]
Logical Methods in Computer Science, 2021 This paper extends a standard process algebra with a time-out operator, thereby increasing its absolute expressiveness, while remaining within the realm of untimed process algebra, in the sense that the progress of time is not quantified.
Rob van Glabbeek
doaj +1 more source
Concurrency and Probability: Removing Confusion, Compositionally [PDF]
Logical Methods in Computer Science, 2019 Assigning a satisfactory truly concurrent semantics to Petri nets with confusion and distributed decisions is a long standing problem, especially if one wants to resolve decisions by drawing from some probability distribution.
Roberto Bruni +2 more
doaj +1 more source
Typing Copyless Message Passing [PDF]
Logical Methods in Computer Science, 2012 We present a calculus that models a form of process interaction based on copyless message passing, in the style of Singularity OS. The calculus is equipped with a type system ensuring that well-typed processes are free from memory faults, memory leaks ...
Viviana Bono, Luca Padovani
doaj +1 more source
Semipullbacks of labelled Markov processes [PDF]
Logical Methods in Computer Science, 2021 A labelled Markov process (LMP) consists of a measurable space $S$ together with an indexed family of Markov kernels from $S$ to itself. This structure has been used to model probabilistic computations in Computer Science, and one of the main problems in
Jan Pachl, Pedro Sánchez Terraf
doaj +1 more source
Chemistry – A European Journal, 2022 AbstractPb2Ti2O5.4F1.2 modified with various metal cocatalysts was studied as a photocatalyst for visible‐light H2 evolution. Although unmodified Pb2Ti2O5.4F1.2 showed negligible activity, modification of its surface with Rh led to the best observed promotional effect among the Pb2Ti2O5.4F1.2 samples modified with a single metal cocatalyst.
Kenta Aihara +7 more
openaire +2 more sources
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
Value of Prothrombin Fragment 1.2 (F 1.2) in the Diagnosis of Stroke in Young Patients With Antiphospholipid Antibodies [PDF]
Clinical and Applied Thrombosis/Hemostasis, 2000 The presence in the serum of antiphospholipid an tibodies (aPL) is associated with venous and arterial thrombo sis. This observation has led to the search for these antibodies in young patients with ischemic neurologic syndromes. How ever, 1% to 5% of healthy people may be found to have cir culating aPL without necessarily being at increased risk of ...
M H, Ellis +5 more
openaire +2 more sources
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem [PDF]
Logical Methods in Computer Science, 2007 In earlier work, the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- was established for several classes of algorithms, including ordinary, interactive, small-step algorithms.
Andreas Blass +3 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
Distribution Bisimilarity via the Power of Convex Algebras [PDF]
Logical Methods in Computer Science, 2021 Probabilistic automata (PA), also known as probabilistic nondeterministic labelled transition systems, combine probability and nondeterminism. They can be given different semantics, like strong bisimilarity, convex bisimilarity, or (more recently ...
Filippo Bonchi +2 more
doaj +1 more source