Branching processes of Petri nets
Acta Informatica
Model Checking Using Net Unfoldings
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Unfolding and Finite Prefix for Nets with Read Arcs
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
An Event Structure Semantics for P/T Contextual Nets: Asymmetric Event Structures
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Information and Computation
McMillan's Complete Prefix for Contextual Nets
Transactions on Petri Nets and Other Models of Concurrency I
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
Timed unfoldings for networks of timed automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Efficient unfolding of contextual Petri nets
Theoretical Computer Science
| Hi-index | 0.01 |
Contextual nets, or Petri nets with read arcs, are models of concurrent systems with context dependent actions. The problem of teachability in such nets consists in finding a sequence of transitions that leads from the initial marking of a given contextual net to a given goal marking. The solution to this problem that is presented in this paper consists in constructing a finite complete prefix of the unfolding of the given contextual net, that is a finite prefix in which all the markings that are reachable from the initial marking are present, and in searching in each branch of this prefix for the goal marking by solving an appropriate linear programming problem.