Sciweavers

85 search results - page 4 / 17
» Partial-Order Reduction in Symbolic State Space Exploration
Sort
View
SARA
2009
Springer
15 years 4 months ago
Integrating Constraint Models for Sequential and Partial-Order Planning
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
Roman Barták, Daniel Toropila
74
Voted
SIGSOFT
2009
ACM
15 years 11 months ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang
80
Voted
FMICS
2008
Springer
14 years 11 months ago
Efficient Symbolic Model Checking for Process Algebras
Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representati...
José Vander Meulen, Charles Pecheur
104
Voted
FORMATS
2006
Springer
15 years 1 months ago
Adding Invariants to Event Zone Automata
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
Peter Niebert, Hongyang Qu
76
Voted
ASYNC
1997
IEEE
103views Hardware» more  ASYNC 1997»
15 years 1 months ago
Efficient Timing Analysis Algorithms for Timed State Space Exploration
This paper presents new timing analysis algorithms for efficient state space exploration during timed circuit synthesis. Timed circuits are a class of asynchronous circuits that i...
Wendy Belluomini, Chris J. Myers