Sciweavers

130 search results - page 5 / 26
» Decidability Problems of a Basic Class of Object Nets
Sort
View
CAV
2010
Springer
206views Hardware» more  CAV 2010»
13 years 11 months ago
Dynamic Cutoff Detection in Parameterized Concurrent Programs
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
Alexander Kaiser, Daniel Kroening, Thomas Wahl
ENTCS
2008
97views more  ENTCS 2008»
13 years 7 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann
CONCUR
2004
Springer
13 years 11 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...
FOSSACS
2010
Springer
14 years 2 months ago
On the Relationship between Spatial Logics and Behavioral Simulations
Abstract. Spatial logics have been introduced to reason about distributed computation in models for concurrency. We first define a spatial logic for a general class of infinite-...
Lucia Acciai, Michele Boreale, Gianluigi Zavattaro
ICDT
1997
ACM
95views Database» more  ICDT 1997»
13 years 11 months ago
Type-Consistency Problems for Queries in Object-Oriented Databases
Abstract Method invocation mechanism is one of the essential features in objectoriented programming languages. This mechanism contributes to data encapsulation and code reuse, but ...
Yasunori Ishihara, Hiroyuki Seki, Minoru Ito