Sciweavers

178 search results - page 32 / 36
» Boolean Algebras in Visser Algebras
Sort
View
FOSSACS
2005
Springer
15 years 3 months ago
Duality for Logics of Transition Systems
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...
Marcello M. Bonsangue, Alexander Kurz
PODC
2003
ACM
15 years 2 months ago
A lattice-theoretic characterization of safety and liveness
The distinction between safety and liveness properties is due to Lamport who gave the following informal characterization. Safety properties assert that nothing bad ever happens w...
Panagiotis Manolios, Richard J. Trefler
GMP
2010
IEEE
190views Solid Modeling» more  GMP 2010»
15 years 2 months ago
A Subdivision Approach to Planar Semi-algebraic Sets
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...
Angelos Mantzaflaris, Bernard Mourrain
DATE
1998
IEEE
103views Hardware» more  DATE 1998»
15 years 1 months ago
Efficient Encoding Schemes for Symbolic Analysis of Petri Nets
Petri nets are a graph-based formalism appropriate to model concurrentsystems such as asynchronouscircuits or network protocols. Symbolic techniques based on Binary Decision Diagr...
Enric Pastor, Jordi Cortadella
CP
2006
Springer
15 years 1 months ago
Approximability of Integer Programming with Generalised Constraints
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh