Sciweavers

47 search results - page 8 / 10
» Decidability Problems in Petri Nets with Names and Replicati...
Sort
View
CONCUR
2004
Springer
15 years 1 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...
LICS
2006
IEEE
15 years 3 months ago
Two-Variable Logic on Words with Data
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentic...
APCCM
2007
14 years 11 months ago
Measuring Similarity between Semantic Business Process Models
A business process may be modeled in different ways by different modelers even when utilizing the same modeling language. An appropriate method for solving ambiguity issues in p...
Marc Ehrig, Agnes Koschmider, Andreas Oberweis
RP
2010
Springer
150views Control Systems» more  RP 2010»
14 years 7 months ago
Rewriting Systems for Reachability in Vector Addition Systems with Pairs
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...
Paulin Jacobé de Naurois, Virgile Mogbil
178
Voted
POPL
2009
ACM
15 years 10 months ago
Verifying liveness for asynchronous programs
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko