A rigorous methodology for specification and verification of business processes
type: Item
instance of: scholarly article
title: A rigorous methodology for specification and verification of business processes
zbMATH Open document ID: 1184.68340
author: Cristian Masalagiu
author: Wei-Ngan Chin
author: Ştefan Andrei
author: Vasile Alaiba
published in: Formal Aspects of Computing
publication date: 2009-11-13T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 90B70
zbMATH DE Number: 5633142
zbMATH Keywords: business process
zbMATH Keywords: unifying computer tool
zbMATH Keywords: specification
zbMATH Keywords: verification
describes a project that uses: SATIRE
describes a project that uses: TLC
describes a project that uses: SPIN
describes a project that uses: NuSMV
MaRDI profile type: Publication
full work available at URL: s00165-009-0106-y
OpenAlex ID: W2030435982
cites work: Counting for satisfiability by inverting resolution
cites work: Q4804909
cites work: A machine program for theorem-proving
cites work: Counting the number of solutions for instances of satisfiability
cites work: Q4040147
cites work: SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation
cites work: Solving the incremental satisfiability problem
cites work: CNF-Satisfiability Test by Counting and Polynomial Average Time
cites work: A Graph-Theoretic Approach for Timing Analysis and its Implementation
cites work: FM 2005: Formal Methods
cites work: Q4003339
cites work: Q3350793
cites work: Q4737002
cites work: The Complexity of Enumeration and Reliability Problems
cites work: Inheritance of Business Processes: A Journey Visiting Four Notorious Problems
cites work: Number of models and satisfiability of sets of clauses
DOI: 10.1007/S00165-009-0106-Y
description: scientific article; zbMATH DE number 5633142