ACM Transactions on Programming Languages and Systems (TOPLAS)
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
ACM Computing Surveys (CSUR)
Shuffle languages, Petri nets, and context-sensitive grammars
Communications of the ACM
Analysis issues in Petri nets with inhibitor arcs
Theoretical Computer Science
An algebraic system for process structuring and interprocess communication
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Domain and event structure semantics for Petri nets with read and inhibitor arcs
Theoretical Computer Science
Comparing Truly Concurrent Semantics for Contextual Place/Transition Nets
Fundamenta Informaticae
Labeled Step Sequences in Petri Nets
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Properties of Multiset Language Classes Defined by Multiset Pushdown Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Reduction rules for reset/inhibitor nets
Journal of Computer and System Sciences
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A classification of the expressive power of well-structured transition systems
Information and Computation
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On the composition of time Petri nets
Discrete Event Dynamic Systems
Bridging the gap between timed automata and bounded time petri nets
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Petri nets with localities and testing
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Generating a Petri net from a CSP specification: A semantics-based method
Advances in Engineering Software
Complexity of the soundness problem of bounded workflow nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Comparing Truly Concurrent Semantics for Contextual Place/Transition Nets
Fundamenta Informaticae
Process Semantics for Place/Transition Nets with Inhibitor and Read Arcs
Fundamenta Informaticae
Comparing the expressive power of well-structured transition systems
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Conservative Elementary Object Systems
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Complexity of the Soundness Problem of Workflow Nets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.02 |
In a labeled Petri Net we assign symbols from an alphabet to some or all the transitions of a Petri Net. To each firing sequence of such a Labeled Petri Net corresponds to a string over the alphabet. We study the languages obtained in this way by all firing sequences of a Petri Net, or by all firing sequences which reach a given final marking. We consider the closure properties of these languages, their characterization, their relation to other language families, and the decidability of various problems concerning these languages. The last chapter relates Petri Nets to Counter Automata and Weak Counter Automata, introduces inhibitor Nets and Priority Nets, and considers extensions and limitations of the Petri Net Languages.