Sciweavers

498 search results - page 49 / 100
» On the Category of Petri Net Computations
Sort
View
GG
2010
Springer
15 years 25 days ago
Verification of Graph Transformation Systems with Context-Free Specifications
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...
Barbara König, Javier Esparza
123
Voted
CONCUR
2006
Springer
15 years 4 months ago
Event Structure Semantics for Nominal Calculi
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
Roberto Bruni, Hernán C. Melgratti, Ugo Mon...
CONCUR
2004
Springer
15 years 6 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König
80
Voted
ICCS
2003
Springer
15 years 5 months ago
An XML-Based Framework for Loosely Coupled Applications on Grid Environments
Abstract. This paper focuses on an XML-based framework for the description of grid environments and complex grid applications. A so-called Grid Job Handler is used to manage these ...
Andreas Hoheisel, Uwe Der
117
Voted
IJFCS
2008
166views more  IJFCS 2008»
15 years 20 days ago
Decidability and Complexity Analysis of Forbidden State Problems for Discrete Event Systems
The conventional forbidden state problem for discrete event systems is concerned with the issue of synthesizing a maximally permissive control policy to prevent a discrete event s...
Hsu-Chun Yen