Sciweavers

239 search results - page 31 / 48
» Duality for Logics of Transition Systems
Sort
View
LMCS
2007
132views more  LMCS 2007»
14 years 11 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
CAV
2008
Springer
158views Hardware» more  CAV 2008»
15 years 1 months ago
Linear Arithmetic with Stars
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...
Ruzica Piskac, Viktor Kuncak
ENTCS
1998
115views more  ENTCS 1998»
14 years 11 months ago
A Testing Equivalence for Reactive Probabilistic Processes
We consider a generalisation of Larsen and Skou’s [19] reactive probabilistic transition systems which exhibit three kinds of choice: action-guarded probabilistic choice, extern...
Marta Z. Kwiatkowska, Gethin Norman
FMCAD
2007
Springer
15 years 5 months ago
Lifting Propositional Interpolants to the Word-Level
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...
Daniel Kroening, Georg Weissenbacher
CONCUR
1993
Springer
15 years 3 months ago
A Practical Technique for Process Abstraction
cal Technique for Process Abstraction Glenn Bruns Department of Computer Science University of Edinburgh Edinburgh EH9 3JZ, UK Abstract. With algebraic laws a process can be simpli...
Glenn Bruns