The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Fairness
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
Petri nets and algebraic specifications
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Languages, automata, and logic
Handbook of formal languages, vol. 3
Symbolic Protocol Verification with Queue BDDs
Formal Methods in System Design
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Verification of a Sliding Window Protocol Using IOA and MONA
FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
On-the-Fly Verification of Linear Temporal Logic
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Using Compositional Preorders in the Verification of Sliding Window Protocal
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Algorithmic Verification of Linear Temporal Logic Specifications
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Edge-Streett/ Edge-Rabin Automata Environment for
Edge-Streett/ Edge-Rabin Automata Environment for
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Maria: Modular Reachability Analyser for Algebraic System Nets
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
State/event-based LTL model checking under parametric generalized fairness
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Model checking LTLR formulas under localized fairness
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
| Hi-index | 0.00 |
Latvala and Heljanko have presented how model checking of linear temporal logic properties of P/T nets with fairness constraints on the transitions can be done efficiently. In this work the procedure is extended to high-level Petri Nets, Coloured Petri Nets in particular. The model checking procedure has been implemented in the MARIA tool. As a case study, a liveness property of a sliding window protocol is model checked. The results indicate that the procedure can cope well with many fairness constraints, which could not have been handled by specifying the constraints as a part of the property to be verified.