Sciweavers

239 search results - page 4 / 48
» Duality for Logics of Transition Systems
Sort
View
TCS
2002
13 years 7 months ago
The continuum as a final coalgebra
oole.stanford.edu/pub/ABSTRACTS Pratt, V.R., "Transition and Cancellation in Concurrency and Branching Time", Math. Structures in Comp. Sci., 13:4, 485-529, August 2003. ...
Dusko Pavlovic, Vaughan R. Pratt
FM
2001
Springer
138views Formal Methods» more  FM 2001»
13 years 12 months ago
An Adequate Logic for Full LOTOS
We present a novel result for a logic for symbolic transition systems based on LOTOS processes. The logic is adequate with respect to bisimulation de ned on symbolic transition sys...
Muffy Calder, Savi Maharaj, Carron Shankland
ICFP
2000
ACM
13 years 12 months ago
The duality of computation
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
Pierre-Louis Curien, Hugo Herbelin
CADE
2005
Springer
14 years 7 months ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev
ICALP
2000
Springer
13 years 11 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen