Sciweavers

4 search results - page 1 / 1
» On the Complexity of Consistency and Complete State Coding f...
Sort
View
ACSD
2006
IEEE
106views Hardware» more  ACSD 2006»
13 years 11 months ago
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence ...
Javier Esparza, Petr Jancar, Alexander Miller
ACSD
2003
IEEE
105views Hardware» more  ACSD 2003»
13 years 8 months ago
Detecting State Coding Conflicts in STG Unfoldings Using SAT
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
CONCUR
1998
Springer
13 years 9 months ago
Algebraic Techniques for Timed Systems
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
Albert Benveniste, Claude Jard, Stephane Gaubert
ICSE
2001
IEEE-ACM
13 years 9 months ago
A Scalable Formal Method for Design and Automatic Checking of User Interfaces
The paper addresses the formal specification, design and implementation of the behavioral component of graphical user interfaces. The complex sequences of visual events and action...
Jean Berstel, Stefano Crespi-Reghizzi, Gilles Rous...