Algorithms for mutual exclusion
Algorithms for mutual exclusion
Theory of linear and integer programming
Theory of linear and integer programming
Linear algebraic calculation of deadlocks and traps
Concurrency and nets: advances in Petri nets
Information Processing Letters
Selected papers on First international colloquium on pseudo-boolean optimization and related topics
Automated Analysis of Concurrent Systems with the Constrained Expression Toolset
IEEE Transactions on Software Engineering
A stubborn attack on state explosion
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Model checking and boolean graphs
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
An empirical evaluation of three methods for deadlock analysis of Ada tasking programs
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Using integer programming to verify general safety and liveness properties
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Free choice Petri nets
Complexity results for 1-safe nets
Theoretical Computer Science
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Formal Development of Reactive Systems - Case Study Production Cell
Formal Development of Reactive Systems - Case Study Production Cell
Checking System Properties via Integer Programming
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
B(PN)2 - a Basic Petri Net Programming Notation
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
A Gentle Introduction to Specification Engineering Using a Case Study in Telecommunications
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Integer Programming in the Analysis of Concurrent Systems
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Petri Net Analysis Using Boolean Manipulation
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Deadlock Checking Using Net Unfoldings
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Improving the Precision of INCA by Eliminating Solutions with Spurious Cycles
IEEE Transactions on Software Engineering
Combining Structural and Enumerative Techniques for the Validation of Bounded Petri Nets
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Attacking Symbolic State Explosion
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Model checking linear logic specifications
Theory and Practice of Logic Programming
Automatic Modeling and Analysis of MSC-specified Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Incremental construction of coverability graphs
Information Processing Letters
Winner determination for mixed multi-unit combinatorial auctions via petri nets
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Algorithm of Translation of MSC-specified System into Petri Net
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
A graphical formalism for mixed multi-unit combinatorial auctions
Autonomous Agents and Multi-Agent Systems
Separability in conflict-free petri nets
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Verification of graph transformation systems with context-free specifications
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Applying CEGAR to the petri net state equation
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
On computing reachability sets of process rewrite systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
A livelock freedom analysis for infinite state asynchronous reactive systems
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Algorithm of Translation of MSC-specified System into Petri Net
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Automatic Modeling and Analysis of MSC-specified Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Efficient coverability analysis by proof minimization
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
The state equation is a verification technique that has beenapplied—not always under this name—to numerous systemsmodelled as Petrinets or communicating automata. Given a safety property P,the state equation is used to derive a necessary condition forP to hold which can be mechanically checked. The necessaryconditions derived from the state equation are known to be of littleuse for systems communicating by means of shared variables, in thesense that many of these systems satisfy the property but not theconditions. In this paper, we use traps, a well-known notionof net theory, to obtain stronger conditions that can still beefficiently checked. We show that the new conditions significantlyextend the range of verifiable systems.