Self-adjusting binary search trees
Journal of the ACM (JACM)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
A decomposition approach for stochastic reward net models
Performance Evaluation
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Improving the Variable Ordering of OBDDs Is NP-Complete
IEEE Transactions on Computers
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Specification in CTL + Past for verification in CTL
Information and Computation - Special issue on EXPRESS 1997
Using the exact state space of a Markov model to compute approximate stationary measures
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Regenerative steady-state simulation of discrete-event systems
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Performability Modeling with UltraSAN
IEEE Software
A Characterization of the Stochastic Process Underlying a Stochastic Petri Net
IEEE Transactions on Software Engineering
The Möbius Framework and Its Implementation
IEEE Transactions on Software Engineering
Using Edge-Valued Decision Diagrams for Symbolic Generation of Shortest Paths
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Lectures on Embedded Systems, European Educational Forum, School on Embedded Systems
Storage Alternatives for Large Structured State Spaces
Proceedings of the 9th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
INFORMS Journal on Computing
A Data Structure for the Efficient Kronecker Solution of GSPNs
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
On Phased Delay Stochastic Petri Nets: Definition and an Application
PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
Efficient Solution of GSPNs Using Canonical Matrix Diagrams
PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
Analysis of Phase-Type Stochastic Petri Nets With Discrete and Continuous Timing
Analysis of Phase-Type Stochastic Petri Nets With Discrete and Continuous Timing
Simulation and numerical solution of stochastic petri nets with discrete and continuous timing
Simulation and numerical solution of stochastic petri nets with discrete and continuous timing
Implicit GSPN reachability set generation using decision diagrams
Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
Probabilistic symbolic model checking with PRISM: a hybrid approach
International Journal on Software Tools for Technology Transfer (STTT) - Special section on tools and algorithms for the construction and analysis of systems
Formal Verification of the NASA Runway Safety Monitor
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient symbolic state-space construction for asynchronous systems
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Approximating stationary measures of structured continuous-time Markov models using matrix diagrams
ACM SIGMETRICS Performance Evaluation Review
Model-Checking the Linux Virtual File System
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Symbolic Reachability Analysis of Integer Timed Petri Nets
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
P-Semiflow Computation with Decision Diagrams
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
CSL Model Checking of Biochemical Networks with Interval Decision Diagrams
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Formalisms for Specifying Markovian Population Models
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
On the connections between PCTL and dynamic programming
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Bounded reachability checking of asynchronous systems using decision diagrams
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Data representation and efficient solution: a decision diagram approach
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Improving static variable orders via invariants
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Parallelising symbolic state-space generators
CAV'07 Proceedings of the 19th international conference on Computer aided verification
A comparative study of stochastic analysis techniques
Proceedings of the 8th International Conference on Computational Methods in Systems Biology
A dynamic firing speculation to speedup distributed symbolic state-space generation
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The ins and outs of the probabilistic model checker MRMC
Performance Evaluation
Symbolic computation of strongly connected components and fair cycles using saturation
Innovations in Systems and Software Engineering
Defining Formalisms for Performance Evaluation With SIMTHESys
Electronic Notes in Theoretical Computer Science (ENTCS)
Fixed-delay events in generalized semi-Markov processes revisited
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Exploiting multiformalism models for testing and performance evaluation in SIMTHESys
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
A fine-grained fullness-guided chaining heuristic for symbolic reachability analysis
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Ten years of saturation: a petri net perspective
Transactions on Petri Nets and Other Models of Concurrency V
The SIMTHESys multiformalism modeling framework
Computers & Mathematics with Applications
MARCIE: model checking and reachability analysis done efficiently
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
We describe the main features of SMART, a software package providing a seamless environment for the logic and probabilistic analysis of complex systems. SMART can combine different formalisms in the same modeling study. For the analysis of logical behavior, both explicit and symbolic state-space generation techniques, as well as symbolic CTL model-checking algorithms, are available. For the study of stochastic and timing behavior, both sparse-storage and Kronecker-based numerical solution approaches are available when the underlying process is a Markov chain, while discrete-event simulation is always applicable regardless of the stochastic nature of the process, and certain classes of non-Markov models can also be solved numerically. Finally, since SMART targets both the classroom and realistic industrial settings as a learning, research, and application tool, it is written in a modular way that allows for easy integration of new formalisms and solution algorithms.