We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
This paper presents a game semantics for LP, Artemov's Logic of Proofs. The language of LP extends that of propositional logic by adding formula-labeling terms, permitting us...
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
Magnus Johansson, Jesper Bengtson, Joachim Parrow,...