Model checking Petri nets with names using data-centric dynamic systems
DOI10.1007/s00165-016-0370-6zbMath1345.68236OpenAlexW2337896169WikidataQ62044490 ScholiaQ62044490MaRDI QIDQ315291
Publication date: 20 September 2016
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-016-0370-6
formal verificationinfinite-state systemsdata-aware business processesfirst-order temporal logicsPetri nets with namesresource-aware business processes
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Soundness of workflow nets: classification, decidability, and analysis
- Decidability and complexity of Petri nets with unordered data
- A new approach to abstract syntax with variable binding
- Elements of finite model theory.
- A note on colored Petri nets
- Computable queries for relational data bases
- First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus
- A Theory of Name Boundedness
- Cost Soundness for Priced Resource-Constrained Workflow Nets
- Verification of Agent-Based Artifact Systems
- Towards nominal computation
- Modeling and Verification of a Protocol for Operational Support Using Coloured Petri Nets
- Coloured Petri Nets
- Understanding Petri Nets
- Description Logic Knowledge and Action Bases
- Database Theory - ICDT 2005
- Applications and Theory of Petri Nets 2004
- Applications and Theory of Petri Nets 2005
- Reasoning about cryptographic protocols in the spi calculus
This page was built for publication: Model checking Petri nets with names using data-centric dynamic systems