Ordinal theory for expressiveness of well structured transition systems

Authors:
Remi Bonnet;Alain Finkel;Serge Haddad;Fernando Rosa-Velardo
Affiliations:
Ecole Normale Supérieure de Cachan, LSV, CNRS UMR 8643, Cachan, France;Ecole Normale Supérieure de Cachan, LSV, CNRS UMR 8643, Cachan, France;Ecole Normale Supérieure de Cachan, LSV, CNRS UMR 8643, Cachan, France;Sistemas Informáticos y Computación, Universidad Complutense de Madrid
Venue:
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Year:
2011

Citing 13
Cited 4

A generalization of the procedure of Karp and Miller to well structured transition systems

14th International Colloquium on Automata, languages and programming
A Formal Framework for the Analysis of Recursive-Parallel Programs

PaCT '97 Proceedings of the 4th International Conference on Parallel Computing Technologies
The Observational Power of Clocks

CONCUR '94 Proceedings of the Concurrency Theory
Timed Petri Nets and BQOs

ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Well-structured languages

Acta Informatica
Nets with Tokens which Carry Data

Fundamenta Informaticae - PETRI NETS 2007
Name Creation vs. Replication in Petri Net Systems

Fundamenta Informaticae - PETRI NETS 2007
A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets

CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
A well-structured framework for analysing petri net extensions

Information and Computation
Forward analysis for petri nets with name creation

PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Language-based comparison of petri nets with black tokens, pure names and ordered data

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Comparing the expressive power of well-structured transition systems

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
The theory of WSTS: the case of complete WSTS

PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
On the coverability and reachability languages of monotonic extensions of Petri nets

Theoretical Computer Science
Ordinal theory for expressiveness of well-structured transition systems

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, for usual classes of wpos, the equivalence between the existence of order reflections (nonmonotonic order embeddings) and the simulations with respect to coverability languages. We show that the non-existence of order reflections can be proved by the computation of order types. This allows us to solve some open problems and to unify the existing proofs of the WSTS classification.