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
The complexity of linear-time temporal logic over the class of ordinals [PDF]
Logical Methods in Computer Science, 2010 We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theorem.
Stephane Demri, Alexander Rabinovich
doaj +1 more source
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness [PDF]
Logical Methods in Computer Science, 2007 We consider Dense-Timed Petri Nets (TPN), an extension of Petri nets in which each token is equipped with a real-valued clock and where the semantics is lazy (i.e., enabled transitions need not fire; time can pass and disable transitions).
Parosh Abdulla +2 more
doaj +1 more source
Extending the theory of Owicki and Gries with a logic of progress [PDF]
Logical Methods in Computer Science, 2006 This paper describes a logic of progress for concurrent programs. The logic is based on that of UNITY, molded to fit a sequential programming model. Integration of the two is achieved by using auxiliary variables in a systematic way that incorporates ...
Brijesh Dongol, Doug Goldson
doaj +1 more source
Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism [PDF]
Logical Methods in Computer Science, 2017 We study a propositional variant of Hoare logic that can be used for reasoning about programs that exhibit both angelic and demonic nondeterminism. We work in an uninterpreted setting, where the meaning of the atomic actions is specified axiomatically ...
Konstantinos Mamouras
doaj +1 more source
Local lower norm estimates for dyadic maximal operators and related Bellman functions [PDF]
, 2015 We provide lower $L^q$ and weak $L^p$-bounds for the localized dyadic maximal operator on $R^n$, when the local $L^1$ and the local $L^p$ norm of the function are given.
Melas, Antonios D. +1 more
core +2 more sources
Coaxioms: flexible coinductive definitions by inference systems [PDF]
Logical Methods in Computer Science, 2020 We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which can only be ...
Francesco Dagnino
doaj +1 more source
A Complete Axiom System for Propositional Interval Temporal Logic with Infinite Time [PDF]
Logical Methods in Computer Science, 2012 Interval Temporal Logic (ITL) is an established temporal formalism for reasoning about time periods. For over 25 years, it has been applied in a number of ways and several ITL variants, axiom systems and tools have been investigated.
Ben Moszkowski
doaj +1 more source
The N=2 vector-tensor multiplet, central charge superspace, and Chern-Simons couplings [PDF]
, 1997 We present a new, alternative interpretation of the vector-tensor multiplet as a 2-form in central charge superspace. This approach provides a geometric description of the (non-trivial) central charge transformations ab initio and is naturally ...
Grimm, Richard +2 more
core +4 more sources
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