Results 251 to 260 of about 1,883,994 (277)
Some of the next articles are maybe not open access.

Replaceable Nets, Net Collineations, and Net Extensions

Canadian Journal of Mathematics, 1966
A net of degree k and order n is a set of n2 points and nk designated sets of points, called lines, such that(1) The lines fall into k disjoint parallel classes, i.e. each line occurs in exactly one parallel class.(2) Lines in the same parallel class have no points in common; lines in different parallel classes have exactly one point in common.(3) Each
openaire   +2 more sources

To net or not to net?

Network Security, 1994
The Internet is the place to be, and be seen. Or, is it? The attractions of Net access need to be weighed against the potential pitfalls. This article addresses some of the questions that should be asked by a company venturing onto the Net and looks at emerging Type Enforcement security technology.
openaire   +1 more source

Embedding of Elementary Net into Gap of Nets

Journal of Mathematical Sciences, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Contextual nets

Acta Informatica, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
U. Montanari, ROSSI, FRANCESCA
openaire   +5 more sources

Encoding Nets-Within-Nets in Maude

2023
Self-adaptive systems gain growing attention to raise service quality and reduce development costs. But on the other hand, self-adaptation is a source of complexity which needs suitable methodologies/models/tools supporting the whole life cycle. A particularly challenging point is the dynamic reconfiguration of a system. This feature, typical of modern
Capra, Lorenzo   +1 more
openaire   +2 more sources

Hornets: Nets within Nets Combined with Net Algebra

2009
In this contribution we propose an algebraic extension of object nets. Object nets, also known as nets within nets , allow nets itself as tokens. The algebraic structure introduced here refers to the topology of these net-tokens, i.e. we have operators which compose nets.
openaire   +2 more sources

Petri Net Computers and Workflow Nets

IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2015
In this paper, a robust and as simple as possible concept of a Petri net (PN) computer is proposed. It has a similar structure and behavior to weak sound priority workflow nets. It is shown that all recursive functions are PN computable and, vice-versa, PN computable functions are recursive.
Ferucio Laurentiu Tiplea   +1 more
openaire   +1 more source

The Semantics of a Net is a Net

1987
A core issue of General Net Theory is to relate different net classes by meaning preserving mappings. To do so in a simple and elegant way, some mathematical techniques will be developed in this paper. This includes special net morphisms and equivalence relations on nets.
Einar Smith, Wolfgang Reisig
openaire   +1 more source

Instantiating nets and their applications to workflow nets

Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005
K-soundness, generalized soundness, and structural soundness are important correctness criteria that workflow nets should satisfy. Using instantiating nets, we present in a uniform way some of the results obtained regarding the decidability status of the generalized and structural soundness properties.
Å¢iplea, Ferucio LaurenÅ£iu   +1 more
openaire   +2 more sources

Eval-net: Elements of Evaluation Nets as Extension to Petri Nets

2016
Evaluation nets and Petri nets are an easy, readable and functional methods for visualizing states and communication between computer systems using diagrams. They can be considered as similar methods, because they base on bilateral graph and there is token flow. However, they differ in elements, token flow rules, structure, and runtime process.
Michal Niedzwiecki   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy