Sciweavers

1167 search results - page 223 / 234
» A Really Temporal Logic
Sort
View
IANDC
2008
114views more  IANDC 2008»
13 years 8 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo
LOGCOM
1998
178views more  LOGCOM 1998»
13 years 8 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh
DLT
2010
13 years 10 months ago
Around Dot Depth Two
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
Kamal Lodaya, Paritosh K. Pandya, Simoni S. Shah
DAC
2007
ACM
14 years 9 months ago
Variation Resilient Low-Power Circuit Design Methodology using On-Chip Phase Locked Loop
This paper presents a variation resilient circuit design technique for maintaining parametric yield of design under inherent variation in process parameters. We propose to utilize...
Kunhyuk Kang, Kee-Jong Kim, Kaushik Roy
ICDT
2009
ACM
248views Database» more  ICDT 2009»
14 years 9 months ago
Automatic verification of data-centric business processes
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
Alin Deutsch, Richard Hull, Fabio Patrizi, Victor ...