A logical approach of Petri net languages
From MaRDI portal
Publication:1083861
DOI10.1016/0304-3975(85)90136-7zbMath0605.68049OpenAlexW2014965607MaRDI QIDQ1083861
Michel Parigot, Elisabeth Pelz
Publication date: 1985
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(85)90136-7
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (8)
Closure properties of locally finite \(\omega\)-languages ⋮ Generalized rational relations and their logical definability ⋮ Normalization of place/transition-systems preserves net behaviour ⋮ Logical definability of some rational trace languages ⋮ A descriptive complexity approach to the linear hierarchy. ⋮ Petri net languages and infinite subsets of \(\mathbb{N}^m\) ⋮ Topological complexity of locally finite \(\omega\)-languages ⋮ Locally finite languages
Cites Work
This page was built for publication: A logical approach of Petri net languages
