Sciweavers

9 search results - page 1 / 2
» Well-structured languages
Sort
View
CSL
2007
Springer
13 years 8 months ago
Comparing the Expressive Power of Well-Structured Transition Systems
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van...
FOSSACS
2011
Springer
12 years 8 months ago
Ordinal Theory for Expressiveness of Well Structured Transition Systems
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
Rémi Bonnet, Alain Finkel, Serge Haddad, Fe...
LATA
2010
Springer
13 years 3 months ago
Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we conside...
Fernando Rosa Velardo, Giorgio Delzanno
DOOD
1995
Springer
124views Database» more  DOOD 1995»
13 years 8 months ago
Querying Semistructured Heterogeneous Information
Abstract. Semistructured data has no absolute schema xed in advance and its structure may be irregular or incomplete. Such data commonly arises in sources that do not impose a rigi...
Dallan Quass, Anand Rajaraman, Yehoshua Sagiv, Jef...