Communicating sequential processes
Communicating sequential processes
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Software model checking in practice: an industrial case study
Proceedings of the 24th International Conference on Software Engineering
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Handbook of automated reasoning
Typed polyadic pi-calculus in bigraphs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Local Bigraphs and Confluence: Two Conjectures
Electronic Notes in Theoretical Computer Science (ENTCS)
Trustworthy Global Computing
The Space and Motion of Communicating Agents
The Space and Motion of Communicating Agents
Pure bigraphs: Structure and dynamics
Information and Computation
DBtk: a toolkit for directed bigraphs
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Reactive systems over directed bigraphs
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A verification environment for bigraphs
Innovations in Systems and Software Engineering
Towards formalising installation and reconfiguration tasks of AADL architecture
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.00 |
We present a model checking tool for Bigraphical Reactive Systems that may be instantiated as a model checker for any formalism or domain-specific modelling language encoded as a Bigraphical Reactive System. We describe the implementation of the tool, and how it can be used to verify correctness properties of some infinite-state models by applying a static analysis to reaction rules that permits the exclusion of some infinite branches of execution shown to always be free of violations. We give a proof of correctness for this method, and illustrate the usage of the tool with two examples --- a textbook implementation of the Dining Philosophers problem, and an example motivated by a ubiquitous computing application.