A Non-Deterministic Multiset Query Language

DOI10.3233/FI-2021-2095MaRDI QIDQ5862341

Bartosz Zielinski

Publication date: 9 March 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.00218

zbMATH Keywords

query languagesterm rewritingbusiness process modelling

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• YAWL
• Maude
• VERIFAS

Cites Work

• Model checking Petri nets with names using data-centric dynamic systems
• Decidability and complexity of Petri nets with unordered data
• The rewriting logic semantics project
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Termination of narrowing revisited
• Conditional rewriting logic as a unified model of concurrency
• Relational transducers for electronic commerce
• Formal verification of complex business processes based on high-level Petri nets
• Transactions on Petri Nets and Other Models of Concurrency XII
• Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
• Matching Logic: An Alternative to Hoare/Floyd Logic
• Model Checking Reconfigurable Petri Nets with Maude
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Matching Logic
• A Query Language Based on Term Matching and Rewriting
• Nominal Sets over Algebraic Atoms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Non-Deterministic Multiset Query Language