Zoom and Enhance: Action Refinement via Subprocesses in Timed Declarative Processes
暂无分享,去创建一个
Søren Debois | Thomas T. Hildebrandt | Tijs Slaats | Håkon Norman | Tijs Slaats | S. Debois | Håkon Norman
[1] Søren Debois,et al. Replication, refinement & reachability: complexity in dynamic condition-response graphs , 2017, Acta Informatica.
[2] P. Merlin,et al. Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.
[3] Ursula Goltz,et al. Refinement of actions and equivalence notions for concurrent systems , 2001, Acta Informatica.
[4] Søren Debois,et al. Concurrency and Asynchrony in Declarative Workflows , 2015, BPM.
[5] Alessandro Sperduti,et al. Conformance checking based on multi-perspective declarative process models , 2015, Expert Syst. Appl..
[6] Manfred Reichert,et al. Investigating expressiveness and understandability of hierarchy in declarative business process models , 2015, Software & Systems Modeling.
[7] Raghava Rao Mukkamala,et al. Contracts for cross-organizational workflows as timed Dynamic Condition Response Graphs , 2013, J. Log. Algebraic Methods Program..
[8] Ichiro Suzuki,et al. A Method for Stepwise Refinement and Abstraction of Petri Nets , 1983, J. Comput. Syst. Sci..
[9] Robert Valette,et al. Analysis of Petri Nets by Stepwise Refinements , 1979, J. Comput. Syst. Sci..
[10] Wil M. P. van der Aalst,et al. Decomposing Petri nets for process mining: A generic approach , 2013, Distributed and Parallel Databases.
[11] Joël Favrel,et al. Hierarchical reduction method for analysis and decomposition of Petri nets , 1985, IEEE Transactions on Systems, Man, and Cybernetics.
[12] Jirí Srba,et al. Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.