Sciweavers

4047 search results - page 238 / 810
» Algebraic Model Checking
Sort
View
CONCUR
2007
Springer
16 years 23 days ago
Pushdown Module Checking with Imperfect Information
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
Benjamin Aminof, Aniello Murano, Moshe Y. Vardi
ENTCS
2007
111views more  ENTCS 2007»
15 years 6 months ago
Reversibility and Models for Concurrency
There is a growing interest in models of reversible computation driven by exciting application areas such as bio-systems and quantum computing. Reversible process algebras RCCS [2...
Iain Phillips, Irek Ulidowski
CC
2010
Springer
135views System Software» more  CC 2010»
15 years 6 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner
JLP
2011
106views more  JLP 2011»
14 years 9 months ago
Concurrent Kleene Algebra and its Foundations
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
Tony Hoare, Bernhard Möller, Georg Struth, Ia...
AAAI
2000
15 years 8 months ago
Disjunctive Temporal Reasoning in Partially Ordered Models of Time
Certain problems in connection with, for example, cooperating agents and distributed systems require reasoning about time which is measured on incomparable or unsynchronized time ...
Mathias Broxvall, Peter Jonsson