Skip to content
<title>Channels - Petri Net Reachability Graphs: Decidability Status of First Order Properties :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Petri Net Reachability Graphs: Decidability Status of First Order Properties
Search for more channels:
Similar Items: Petri Net Reachability Graphs: Decidability Status of First Order Properties
Channel Options
View Record
Explore related channels
Quick Look
Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
Quick Look
Priced Timed Petri Nets
Quick Look
Structurally Cyclic Petri Nets
Quick Look
Separators in Continuous Petri Nets
Quick Look
Bounded Reachability Problems are Decidable in FIFO Machines
Quick Look
Event Structures for Petri nets with Persistence
Quick Look
Craig Interpolation for Decidable First-Order Fragments
Quick Look
Applying CEGAR to the Petri Net State Equation
Quick Look
Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets
Quick Look
Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
Quick Look
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems
Quick Look
On the Home-Space Problem for Petri Nets and its Ackermannian Complexity
Quick Look
Relating Reversible Petri Nets and Reversible Event Structures, categorically
Quick Look
Decidability of Querying First-Order Theories via Countermodels of Finite Width
Quick Look
On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
Quick Look
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
Quick Look
A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets
Quick Look
Simulating reachability using first-order logic with applications to verification of linked data structures
Quick Look
Decidability of higher-order matching
Quick Look
On first-order transductions of classes of graphs
Quick Look
Decidable Expansions of Labelled Linear Orderings
Quick Look
Petri Automata
Quick Look
Positive First-order Logic on Words and Graphs
Quick Look
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Load more items
View Record
Prev
Explore related channels
Next
