Sciweavers

4217 search results - page 113 / 844
» Computational indistinguishability logic
Sort
View
BIRTHDAY
2006
Springer
15 years 1 months ago
Quantum Institutions
The exogenous approach to enriching any given base logic for probabilistic and quantum reasoning is brought into the realm of institutions. The theory of institutions helps in capt...
Carlos Caleiro, Paulo Mateus, Amílcar Serna...
FSTTCS
2000
Springer
15 years 1 months ago
Model Checking CTL Properties of Pushdown Systems
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
Igor Walukiewicz
TCS
1998
14 years 9 months ago
Proving Possibility Properties
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
Leslie Lamport
FUIN
2010
172views more  FUIN 2010»
14 years 7 months ago
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...
DLT
2009
14 years 7 months ago
Weighted Timed MSO Logics
We aim to generalize B
Karin Quaas