Tools and Algorithms for the Construction and Analysis of Systems

Dependency Graphs and Their Application to Model Checking . . . . 316 Søren Enevoldsen, Kim Guldstrand Larsen, and Jiří Srba

[1]  Joseph Sifakis,et al.  Rigorous Component-Based System Design Using the BIP Framework , 2011, IEEE Software.

[2]  Ichiro Suzuki,et al.  Proving Properties of a Ring of Finite-State Machines , 1988, Inf. Process. Lett..

[3]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[4]  Marta Z. Kwiatkowska,et al.  PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.

[5]  Jean Mairesse,et al.  Asymptotic analysis of heaps of pieces and application to timed Petri nets , 1999, Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331).

[6]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.

[7]  Lothar Thiele,et al.  The Complexity of Deadline Analysis for Workflow Graphs with Multiple Resources , 2016, BPM.

[8]  Viktor Kuncak,et al.  Deciding Boolean Algebra with Presburger Arithmetic , 2006, Journal of Automated Reasoning.

[9]  Parosh Aziz Abdulla,et al.  Well (and Better) Quasi-Ordered Transition Systems , 2010, The Bulletin of Symbolic Logic.

[10]  Javier Esparza,et al.  Computing the Expected Execution Time of Probabilistic Workflow Nets , 2019, TACAS.

[11]  Amir Pnueli,et al.  Symbolic model checking with rich assertional languages , 2001, Theor. Comput. Sci..

[12]  Cesare Tinelli,et al.  A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT , 2016, IJCAR.

[13]  Gethin Norman,et al.  Verification and control of partially observable probabilistic systems , 2017, Real-Time Systems.

[14]  Joseph Sifakis,et al.  D-Finder: A Tool for Compositional Deadlock Detection and Verification , 2009, CAV.

[15]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[16]  Lijun Zhang,et al.  Probabilistic Reachability for Parametric Markov Models , 2009, SPIN.

[17]  Peter Müller,et al.  Diagnostic Information for Control-Flow Analysis of Workflow Graphs (a.k.a. Free-Choice Workflow Nets) , 2016, TACAS.

[18]  Javier Esparza,et al.  Polynomial analysis algorithms for free choice Probabilistic Workflow Nets , 2016, Perform. Evaluation.

[19]  Sebastian Junges,et al.  Permissive Finite-State Controllers of POMDPs using Parameter Synthesis , 2017, ArXiv.

[20]  Pedro R. D'Argenio,et al.  Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms , 2014, Theor. Comput. Sci..

[21]  Ted Herman,et al.  Probabilistic Self-Stabilization , 1990, Information Processing Letters.

[22]  Nils Jansen,et al.  Symbolic counterexample generation for large discrete-time Markov chains , 2014, Sci. Comput. Program..

[23]  Javier Esparza,et al.  Reduction Rules for Colored Workflow Nets , 2016, FASE.

[24]  Pierre-Yves Schobbens,et al.  Modeling and Verification for Probabilistic Properties in Software Product Lines , 2015, 2015 IEEE 16th International Symposium on High Assurance Systems Engineering.

[25]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[26]  Simone D. J. Barbosa,et al.  Stairway to value : mining a loan application process , 2017 .

[27]  Karsten Stahl,et al.  Abstracting WS1S Systems to Verify Parameterized Networks , 2000, TACAS.

[28]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[29]  Christel Baier,et al.  Principles of model checking , 2008 .

[30]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .

[31]  Grzegorz Rozenberg,et al.  Petri Nets: Basic Notions, Structure, Behaviour , 1986, Current Trends in Concurrency.

[32]  Hajo A. Reijers,et al.  The Multi-perspective Process Explorer , 2015, BPM.

[33]  Axel Legay,et al.  QFLan: A Tool for the Quantitative Analysis of Highly Reconfigurable Systems , 2018, FM.

[34]  Philippe Chrétienne,et al.  Timed Petri net schedules , 1987, European Workshop on Applications and Theory of Petri Nets.

[35]  Markus N. Rabe,et al.  Verification of Partial-Information Probabilistic Systems Using Counterexample-Guided Refinements , 2012, ATVA.

[36]  Jean Mairesse,et al.  Modeling and analysis of timed Petri nets using heaps of pieces , 1997, 1997 European Control Conference (ECC).

[37]  Sebastian Junges,et al.  A Storm is Coming: A Modern Probabilistic Model Checker , 2017, CAV.

[38]  Sriram K. Rajamani,et al.  Efficient synthesis of probabilistic programs , 2015, PLDI.

[39]  Marta Z. Kwiatkowska,et al.  Probabilistic verification of Herman’s self-stabilisation algorithm , 2012, Formal Aspects of Computing.

[40]  Stephen P. Boyd,et al.  Techniques for exploring the suboptimal set , 2010 .

[41]  Dirk Fahland,et al.  The relationship between workflow graphs and free-choice workflow nets , 2015, Inf. Syst..

[42]  Kees M. van Hee,et al.  Workflow Management: Models, Methods, and Systems , 2002, Cooperative information systems.

[43]  Leopold Löwenheim.  Über Möglichkeiten im Relativkalkül , 1915 .

[44]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[45]  Sylvain Conchon,et al.  Cubicle: A Parallel SMT-Based Model Checker for Parameterized Systems - Tool Paper , 2012, CAV.

[46]  M. Gario,et al.  PySMT: a Solver-Agnostic Library for Fast Prototyping of SMT-Based Algorithms , 2015 .

[47]  Dirk Fahland,et al.  Instantaneous Soundness Checking of Industrial Business Process Models , 2009, BPM.

[48]  Jörg Desel,et al.  Modeling, Simulation and Analysis of Business Processes , 2000, Business Process Management.

[49]  Moe Thandar Wynn,et al.  Soundness of workflow nets: classification, decidability, and analysis , 2011, Formal Aspects of Computing.

[50]  Jane N. Hagstrom,et al.  Computational complexity of PERT problems , 1988, Networks.

[51]  Carlo Ghezzi,et al.  Model-based verification of quantitative non-functional properties for software product lines , 2013, Inf. Softw. Technol..

[52]  Nils Jansen,et al.  A Greedy Approach for the Efficient Repair of Stochastic Models , 2015, NFM.

[53]  Radu Calinescu,et al.  Synthesis of probabilistic models for quality-of-service software engineering , 2018, Automated Software Engineering.