Displaying similar documents to “Bisimulation on speed : lower time bounds”

Bisimulation on speed: Lower time bounds

Gerald Lüttgen, Walter Vogler (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

More than a decade ago, Moller and Tofts published their seminal work on relating processes, which are annotated with lower time bounds, with respect to speed. Their paper has left open many questions regarding the semantic theory for the suggested bisimulation-based faster-than preorder, the MT-preorder, which have not been addressed since. The encountered difficulties concern a general compositionality result, a complete axiom system for finite processes, a convincing intuitive...

On the analysis of Petri nets and their synthesis from process languages

Ludwik Czaja (2003)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Processes in Place/Transition (P/T) nets are defined inductively by a peculiar numbering of place occurrences. Along with an associative sequential composition called catenation and a neutral process, a monoid of processes is obtained. The power algebra of this monoid contains all process languages with appropriate operations on them. Hence the problems of analysis and synthesis, analogous to those in the formal languages and automata theory, arise. Here, the analysis problem is: for...

Ergodicity and perturbation bounds for inhomogeneous birth and death processes with additional transitions from and to the origin

Alexander Zeifman, Anna Korotysheva, Yacov Satin, Victor Korolev, Sergey Shorgin, Rostislav Razumchik (2015)

International Journal of Applied Mathematics and Computer Science

Similarity:

Service life of many real-life systems cannot be considered infinite, and thus the systems will be eventually stopped or will break down. Some of them may be re-launched after possible maintenance under likely new initial conditions. In such systems, which are often modelled by birth and death processes, the assumption of stationarity may be too strong and performance characteristics obtained under this assumption may not make much sense. In such circumstances, timedependent analysis...

BPMN Analysis of Public Procurement

Semerdjieva, Maria, Krastev, Evgeniy (2012)

Serdica Journal of Computing

Similarity:

ACM Computing Classification System (1998): D.0, D.2.11. This paper formulates a realistic case study of a public procurement process, where the national legal system is taken in consideration. Business Process Modeling Notation (BPMN) is used for encoding processes related to the analysis of public procurement tasks. Critical elements in the public procurement process that affect time, quality and cost are identified at the organizational, process execution and system levels....