Sciweavers

9 search results - page 2 / 2
» Continuous Petri Nets: Expressive Power and Decidability Iss...
Sort
View
LFCS
2007
Springer
13 years 10 months ago
A Decidable Temporal Logic of Repeating Values
Various logical formalisms with the freeze quantifier have been recently considered to model computer systems even though this is a powerful mechanism that often leads to undecida...
Stéphane Demri, Deepak D'Souza, Régi...
CONCUR
2004
Springer
13 years 8 months ago
Extended Process Rewrite Systems: Expressiveness and Reachability
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
Mojmír Kretínský, Vojtech Reh...
INTERNET
2006
149views more  INTERNET 2006»
13 years 4 months ago
Concurrent Multiple-Issue Negotiation for Internet-Based Services
Negotiation is a technique for reaching mutually beneficial agreement among autonomous entities. A concurrent negotiation problem occurs when one entity is negotiating simultaneous...
Jiangbo Dang, Michael N. Huhns
CONCUR
2004
Springer
13 years 9 months ago
The Pros and Cons of Netcharts
Netcharts have been introduced recently by Mukund et al. in [17]. This new appealing approach to the specification of collections of message sequence charts (MSCs) benefits from ...
Nicolas Baudru, Rémi Morin