Sciweavers

2850 search results - page 13 / 570
» On Timed Models and Full Abstraction
Sort
View
FORMATS
2010
Springer
13 years 5 months ago
From Mtl to Deterministic Timed Automata
Abstract. In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic MTL, under bounded-variability assumptions. We handle fu...
Dejan Nickovic, Nir Piterman
LICS
2010
IEEE
13 years 5 months ago
Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction
ing the differential semantics of rule-based models: exact and automated model reduction (Invited Lecture) Vincent Danos∗§, J´erˆome Feret†, Walter Fontana‡, Russell Harme...
Vincent Danos, Jérôme Feret, Walter F...
LICS
1994
IEEE
13 years 11 months ago
A Fully Abstract Semantics for Concurrent Graph Reduction
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
Alan Jeffrey
ESOP
2005
Springer
14 years 28 days ago
Java Jr: Fully Abstract Trace Semantics for a Core Java Language
: Fully abstract trace semantics for a core Java language. Alan Jeffrey 1,2 and Julian Rathke3 1 Bell Labs, Lucent Technologies, Chicago, IL, USA 2 DePaul University, Chicago, IL, ...
Alan Jeffrey, Julian Rathke
POPL
1995
ACM
13 years 11 months ago
Default Timed Concurrent Constraint Programming
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta