Model checking using net unfoldings
Author:
- Javier EsparzaJEJavier Esparza
- 1 December 1994
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 23 (2-3) , 151-195
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Complexity results for 1-safe netsLecture Notes in Computer Science, 1993
- A solution to the covering problem for 1-bounded conflict-free Petri nets using Linear ProgrammingInformation Processing Letters, 1992
- Branching processes of Petri netsActa Informatica, 1991
- Reasoning about networks with many identical finite state processesInformation and Computation, 1989
- Sequential and concurrent behaviour in Petri net theoryTheoretical Computer Science, 1987
- An O(n1.5) algorithm to decide boundedness for conflict-free vector replacement systemsInformation Processing Letters, 1987
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- The temporal logic of branching timeActa Informatica, 1983
- SynchronisationsgraphenActa Informatica, 1973
- Marked directed graphsJournal of Computer and System Sciences, 1971