Sciweavers

98 search results - page 7 / 20
» LTL Model Checking for Modular Petri Nets
Sort
View
ASP
2001
Springer
13 years 11 months ago
Answer Set Programming and Bounded Model Checking
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
Keijo Heljanko, Ilkka Niemelä
CONCUR
2000
Springer
13 years 11 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
ICCAD
2003
IEEE
129views Hardware» more  ICCAD 2003»
14 years 3 months ago
ILP Models for the Synthesis of Asynchronous Control Circuits
A new technique for the logic synthesis of asynchronous circuits is presented. It is based on the structural theory of Petri nets and integer linear programming. The technique is ...
Josep Carmona, Jordi Cortadella
DEDS
2006
111views more  DEDS 2006»
13 years 6 months ago
Model Checking of Time Petri Nets Using the State Class Timed Automaton
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
Didier Lime, Olivier H. Roux
ATVA
2007
Springer
98views Hardware» more  ATVA 2007»
13 years 10 months ago
Model Checking Bounded Prioritized Time Petri Nets
Bernard Berthomieu, Florent Peres, François...