Sciweavers

49 search results - page 1 / 10
» A Compact Petri Net Representation for Concurrent Programs
Sort
View
ICSE
1995
IEEE-ACM
13 years 8 months ago
A Compact Petri Net Representation for Concurrent Programs
This paper presents a compact Petri net representation that is e cient to construct for concurrent programs that use explicit tasking and rendezvous style communication. These Pet...
Matthew B. Dwyer, Lori A. Clarke, Kari A. Nies
DEDS
2007
104views more  DEDS 2007»
13 years 5 months ago
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
Eric Fabre
LPNMR
2001
Springer
13 years 9 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
EMSOFT
2005
Springer
13 years 10 months ago
A structural approach to quasi-static schedulability analysis of communicating concurrent programs
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
13 years 9 months ago
Qualitative diagnosability of labeled petri nets revisited
Abstract— In recent years, classical discrete event fault diagnosis techniques have been extended to Petri Net system models under partial order semantics [8], [9], [13]. In [14]...
Stefan Haar