Sciweavers

1167 search results - page 164 / 234
» A Really Temporal Logic
Sort
View
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
15 years 6 months ago
Model Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
Benedikt Bollig, Martin Leucker
COCOON
2003
Springer
15 years 6 months ago
Petri Nets with Simple Circuits
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
Hsu-Chun Yen, Lien-Po Yu
CC
2001
Springer
177views System Software» more  CC 2001»
15 years 6 months ago
Imperative Program Transformation by Rewriting
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
David Lacey, Oege de Moor
IDA
2001
Springer
15 years 6 months ago
Fluent Learning: Elucidating the Structure of Episodes
Fluents are logical descriptions of situations that persist, andcompositefluents are statistically significant temporal relationships(nearlyidentical withthosein Allen’stemporal...
Paul R. Cohen
TIME
1994
IEEE
15 years 5 months ago
Hypothetical Reasoning from Situation Calculus to Event Calculus
Pinto and Reiter have argued that the Situation Calculus, improved with time handling axioms, subsumes the features of linear time temporal formalisms such as Event Calculus and I...
Alessandro Provetti