Sciweavers

528 search results - page 53 / 106
» Transition Logic Revisited
Sort
View
ASIAN
1998
Springer
111views Algorithms» more  ASIAN 1998»
15 years 8 months ago
A Comparison of Petri Net Semantics under the Collective Token Philosophy
In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities betwe...
Roberto Bruni, José Meseguer, Ugo Montanari...
CONCUR
2006
Springer
15 years 8 months ago
Liveness, Fairness and Impossible Futures
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
Rob J. van Glabbeek, Marc Voorhoeve
JOLLI
2006
80views more  JOLLI 2006»
15 years 4 months ago
Means-End Relations and a Measure of Efficacy
Abstract. Propositional dynamic logic (PDL) provides a natural setting for semantics of means-end relations involving non-determinism, but such models do not include probabilistic ...
Jesse Hughes, Albert C. Esterline, Bahram Kimiagha...
QEST
2005
IEEE
15 years 10 months ago
iLTLChecker: A Probabilistic Model Checker for Multiple DTMCs
iLTL is a probabilistic temporal logic that can specify properties of multiple discrete time Markov chains (DTMCs). In this paper, we describe two related tools: MarkovEstimator a...
YoungMin Kwon, Gul A. Agha
ICCAD
2003
IEEE
148views Hardware» more  ICCAD 2003»
16 years 1 months ago
The Compositional Far Side of Image Computation
Symbolic image computation is the most fundamental computation in BDD-based sequential system optimization and formal verification. In this paper, we explore the use of over-appr...
Chao Wang, Gary D. Hachtel, Fabio Somenzi