Causality in Bounded Petri Nets is MSO Definable

DOI10.1007/978-3-662-52921-8_13zbMath1478.68189OpenAlexW2480434104MaRDI QIDQ2820695

Mateus de Oliveira Oliveira

Publication date: 9 September 2016

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-52921-8_13

zbMATH Keywords

monadic second-order logicdefinabilityrecognizabilitypartial-order behaviour of Petri nets

Mathematics Subject Classification ID

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) Higher-order logic (03B16)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recognizability equals definability for graphs of bounded treewidth and bounded chordality
• Modular construction and partial order semantics of Petri nets
• The equational theory of pomsets
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• Context-free graph grammars and concatenation of graphs
• Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees
• Finite graph automata for linear and boundary graph languages
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• MSO Logic and the Partial Order Semantics of Place/Transition-Nets
• Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs
• Canonizable Partial Order Generators
• Weak Second‐Order Arithmetic and Finite Automata
• On the Recognizability of Arrow and Graph Languages
• Graph expressions and graph rewritings
• Recognizability equals definability for partial k-paths
• Definability Equals Recognizability for $k$-Outerplanar Graphs
• Hasse Diagram Generators and Petri Nets

This page was built for publication: Causality in Bounded Petri Nets is MSO Definable