Sciweavers

102 search results - page 9 / 21
» Evolving Concurrent Petri Net Models of Epistasis
Sort
View
ASP
2001
Springer
14 years 1 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
14 years 5 days ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
SMC
2007
IEEE
105views Control Systems» more  SMC 2007»
14 years 2 months ago
Performance evaluation of petri nets execution algorithms
— In this paper we present a performance evaluation of interpreted and centralized implementation techniques of Petri nets. These implementation techniques allow the translation ...
Ramon Piedrafita Moreno, José Luis Villarro...
ACSD
2008
IEEE
114views Hardware» more  ACSD 2008»
14 years 3 months ago
Modeling and verifying asynchronous communication mechanisms using coloured Petri nets
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, two automati...
Kyller Costa Gorgônio, Fei Xia
FSTTCS
2009
Springer
14 years 3 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya