An Optimality Principle for Concurrent Systems
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Oclets --- Scenario-Based Modeling with Petri Nets
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Improving Time Series Forecasting by Discovering Frequent Episodes in Sequences
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings
Fundamenta Informaticae - Application of Concurrency to System Design
Succinct discrete time approximations of distributed hybrid automata
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
A nice labelling for tree-like event structures of degree 3
Information and Computation
Diagnosis using unfoldings of parametric time Petri nets
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Petri nets for modelling metabolic pathways: a survey
Natural Computing: an international journal
Symbolic unfolding of parametric stopwatch Petri nets
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
A false history of true concurrency: from Petri to tools
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Model-checking games for fixpoint logics with partial order models
Information and Computation
Performance modeling of distributed collaboration services
Proceedings of the 2nd ACM/SPEC International Conference on Performance engineering
Generalised computation of behavioural profiles based on petri-net unfoldings
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Concurrent logic games on partial orders
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Occurrence nets then and now: the path to structured occurrence nets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Construction and SAT-based verification of contextual unfoldings
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Efficient contextual unfolding
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Performance evaluation of schedulers in a probabilistic setting
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Checking bounded reachability in asynchronous systems by symbolic event tracing
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Symbolic performance analysis of elastic systems
Proceedings of the International Conference on Computer-Aided Design
Structuring acyclic process models
Information Systems
Petri nets with localities and testing
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Efficient computation of causal behavioural profiles using structural decomposition
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
A characterization of combined traces using labeled stratified order structures
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Causality in structured occurrence nets
Dependable and Historic Computing
Unfoldings of bounded hybrid petri nets
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Exploiting step semantics for efficient bounded model checking of asynchronous systems
Science of Computer Programming
Using unfoldings in automated testing of multithreaded programs
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
On Three Alternative Characterizations of Combined Traces
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Causal Behavioural Profiles - Efficient Computation, Applications, and Evaluation
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings
Fundamenta Informaticae - Application of Concurrency to System Design
Data and abstraction for scenario-based modeling with petri nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Livelock and deadlock detection for PA inter-organizational business processes
EGOVIS'12/EDEM'12 Proceedings of the 2012 Joint international conference on Electronic Government and the Information Systems Perspective and Electronic Democracy, and Proceedings of the 2012 Joint international conference on Advancing Democracy, Government and Governance
Verification of petri nets with read arcs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Simplifying discovered process models in a controlled manner
Information Systems
Causality-Based verification of multi-threaded programs
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Program Verification: State of the Art, Problems, and Results. II1
Cybernetics and Systems Analysis
On a Homomorphism of a Component Petri Net
Cybernetics and Systems Analysis
Symbolic unfolding of parametric stopwatch Petri nets
Formal Methods in System Design
Defining Multi-Party Compromises using Unfoldings of Workflow Nets
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.00 |
Model checking is a prominent technique used in the hardware and software industries for automatic verification. While it is very successful in finding subtle bugs in distributed systems, it faces the state explosion problem - the number of reachable states grows exponentially in the number of concurrent components. In this book the authors introduce unfoldings, an approach to model checking which alleviates the state explosion problem by means of concurrency theory. They offer a gentle introduction to the basics of the method, and in particular they detail an unfolding-based algorithm for model checking concurrent systems against properties specified as formulas of linear temporal logic (LTL). Self-contained chapters cover transition systems and their products; unfolding products; search procedures for basic verification problems, such as reachability and livelocks; and model checking LTL. The final chapter summarizes the results of the book, and points the reader to tools and case studies. The book will be of value to researchers and graduate students engaged in automatic verification and concurrency theory.