Sciweavers

FOSSACS
2009
Springer
13 years 8 months ago
The Calculus of Handshake Configurations
Handshake protocols are asynchronous protocols that enforce several properties such as absence of transmission interference and insensitivity from delays of propagation on wires. W...
Luca Fossati, Daniele Varacca
APN
2009
Springer
13 years 8 months ago
Deficiency Zero Petri Nets and Product Form
Abstract. Consider a Markovian Petri net with race policy. The marking process has a "product form" stationary distribution if the probability of viewing a given marking ...
Jean Mairesse, Hoang-Thach Nguyen
MM
1993
ACM
122views Multimedia» more  MM 1993»
13 years 8 months ago
Synchronization Models for Multimedia Presentation with User Participation
This paper addresses the key issue of providing flexible multimedia presentation with user participation and suggests synchronization models which can specify the user participat...
B. Prabhakaran, S. V. Raghavan
FSTTCS
1993
Springer
13 years 8 months ago
Complexity Results for 1-safe Nets
We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete f...
Allan Cheng, Javier Esparza, Jens Palsberg
DAC
1994
ACM
13 years 8 months ago
A Communicating Petri Net Model for the Design of Concurrent Asynchronous Modules
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...
Gjalt G. de Jong, Bill Lin
APN
1994
Springer
13 years 8 months ago
On the Model of Computation of Place/Transition Petri Nets
Abstract. In the last few years, the semantics of Petri nets has been investigated in several different ways. Apart from the classical "token game", one can model the beh...
José Meseguer, Ugo Montanari, Vladimiro Sas...
APN
1994
Springer
13 years 8 months ago
Coloured Petri Nets Extended with Channels for Synchronous Communication
This paper shows how Coloured Petri Nets (CP-nets) can be extended to support synchronous communication. We introduce coloured communication channels through which transitions are...
Søren Christensen, Niels Damgaard Hansen
SIGSOFT
1996
ACM
13 years 9 months ago
Abstracting Dependencies between Software Configuration Items
ing Dependencies between Software Configuration Items CARL A. GUNTER University of Pennsylvania icle studies an abstract model of dependencies between software configuration items ...
Carl A. Gunter
LFCS
1997
Springer
13 years 9 months ago
Back-Forth Equivalences for Design of Concurrent Systems
The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets. Back-forth bisimulation equivalences known from the literature a...
Igor V. Tarasyuk
DAC
1996
ACM
13 years 9 months ago
Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
Eric Verlind, Gjalt G. de Jong, Bill Lin