scientific article; zbMATH DE number 1302042
From MaRDI portal
Publication:4247285
Cited in
(41)- The complexity of synthesizing elementary net systems relative to natural parameters
- scientific article; zbMATH DE number 7447773 (Why is no real title available?)
- Step traces
- Expansion nets and expansion processes of elementary net systems
- Nested-unit Petri nets
- Interval traces with mutex relation
- scientific article; zbMATH DE number 7147446 (Why is no real title available?)
- Well-structuredness, safeness and soundness: a formal classification of BPMN collaborations
- scientific article; zbMATH DE number 4037217 (Why is no real title available?)
- On Interval Semantics of Inhibitor and Activator Nets
- Localities in systems with a/sync communication
- Process semantics of general inhibitor nets
- On interval process semantics of Petri nets with inhibitor arcs
- Introducing time in reaction systems
- Typed event structures and the linear \(\pi \)-calculus
- Processes of membrane systems with promoters and inhibitors
- Comparative trace semantics of time Petri nets
- Relational structures for concurrent behaviours
- Automatic decomposition of Petri nets into automata networks -- a synthetic account
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs
- The mutex paradigm of concurrency
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
- Interval semantics for Petri nets with inhibitor arcs
- Property-preserving transformations of elementary net systems based on morphisms
- Confusion control in generalized Petri nets using synchronized events
- Probabilistic event structures and domains
- Modeling Petri Nets by Local Action Systems1 1Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and Esprit Working Group APPLIGRAPH through Universitaire Instelling Antwerpen.
- A Petri net model for membrane systems with dynamic structure
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
- Algebraic structure of step traces and interval traces
- On intransitive non-interference in some models of concurrency
- Token multiplicity in reversing Petri nets under the individual token interpretation
- Confusion analysis and detection for workflow nets
- Modeling Distributed Private Key Generation by Composing Petri Nets
- scientific article; zbMATH DE number 4037216 (Why is no real title available?)
- Step semantics of Boolean nets
- Modeling concurrency with interval traces
- Failures: Their Definition, Modelling and Analysis
- The true concurrency of differential interaction nets
- Phase semantics and Petri net interpretation for resource-sensitive strong negation
- On the Analysis of Petri Nets and their Synthesis from Process Languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247285)