Nets with tokens which carry data

Nets with tokens which carry data

Veure altres versions (2)

We study data nets, a generalisation of Petri nets in which tokens carry data from linearlyordered infinite domains and in which whole-place operations such as resets and transfers are possible. Data nets subsume several known classes of infinite-state systems, including multiset rewriting systems a...

Descripció completa

Dades bibliogràfiques
Autors principals:	Lazić, R, Newcomb, T, Ouaknine, J, Roscoe, A, Worrell, J
Format:	Journal article
Idioma:	English
Publicat:	2008

Ítems similars

Nets with Tokens which Carry Data
per: Lazic, R, et al.
Publicat: (2008)

Nets with Tokens Which Carry Data
per: Roscoe, A, et al.
Publicat: (2007)

Three tokens in Herman's algorithm
per: Kiefer, S, et al.
Publicat: (2012)

On Model Checking Data−independent Systems with Arrays without Reset
per: Roscoe, A, et al.
Publicat: (2001)

On Model Checking Data−independent Systems with Arrays without Reset
per: Roscoe, A, et al.
Publicat: (2004)

On Model checking data−independent systems with arrays with whole−array operations
per: Roscoe, A, et al.
Publicat: (2005)

Zeno, Hercules, and the Hydra: Safety metric temporal logic is Ackermann-complete
per: Lazić, R, et al.
Publicat: (2016)

Verifying Determinism of Concurrent Systems Which Use Unbounded Arrays
per: Roscoe, A, et al.
Publicat: (1998)

Polymorphic Systems with Arrays‚ 2−Counter Machines and Multiset Rewriting
per: Roscoe, A, et al.
Publicat: (2004)

Polymorphic systems with arrays: decidability and undecidability
per: Roscoe, A, et al.
Publicat: (2003)

A Static Analysis Framework for Livelock Freedom in CSP
per: Ouaknine, J, et al.
Publicat: (2013)

Static Livelock Analysis in CSP
per: Ouaknine, J, et al.
Publicat: (2011)

Static Livelock Analysis in CSP
per: Ouaknine, J, et al.
Publicat: (2011)

Static livelock analysis in CSP
per: Ouaknine, J, et al.
Publicat: (2011)

A Static Analysis Framework for Livelock Freedom in CSP
per: Ouaknine, J, et al.
Publicat: (2013)

A Static Analysis Framework for Livelock Freedom in CSP
per: Ouaknine, J, et al.
Publicat: (2012)

The automatic detection of token structures and invariants using SAT checking
per: Antonino, P, et al.
Publicat: (2017)

A Static Analysis Framework for Livelock Freedom in CSP
per: Joel Ouaknine, et al.
Publicat: (2013-09-01)

Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
per: Parosh Abdulla, et al.
Publicat: (2007-02-01)

Decentralized token economy theory (DeTEcT): token pricing, stability and governance for token economies
per: R. Sadykhov, et al.
Publicat: (2023-11-01)

Tokenization of Assets: Security Tokens in Liechtenstein and Switzerland
per: Angelika K. Layr
Publicat: (2021-09-01)

Data independence with predicate symbols
per: Roscoe, A, et al.
Publicat: (1999)

Token-wise sentiment decomposition for ConvNet: Visualizing a sentiment classifier
per: Piyush Chawla, et al.
Publicat: (2020-06-01)

Some Recent Results in Metric Temporal Logic
per: Ouaknine, J, et al.
Publicat: (2008)

On metric temporal logic and faulty turing machines
per: Ouaknine, J, et al.
Publicat: (2006)

Towards a Theory of Time-Bounded Verification.
per: Ouaknine, J, et al.
Publicat: (2010)

Safety metric temporal logic is fully decidable
per: Ouaknine, J, et al.
Publicat: (2006)

Decision Problems for Linear Recurrence Sequences.
per: Ouaknine, J, et al.
Publicat: (2012)

ON THE DECIDABILITY AND COMPLEXITY OF METRIC TEMPORAL LOGIC OVER FINITE WORDS
per: Ouaknine, J, et al.
Publicat: (2007)

Inside the token-ring /
per: 406032 Haugdhal, J. Scott
Publicat: (1986)

The token-token identity-theory and recent theories of reference
per: Gjelsvik, O, et al.
Publicat: (1986)

The Token Female
per: Cindra S. Kamphoff, et al.
Publicat: (2010-12-01)

“No” and “net” as response tokens in English and Russian business discourse: In search of a functional equivalence
per: Elena N. Malyuga, et al.
Publicat: (2021-06-01)

Recent developments in FDR
per: Armstrong, P, et al.
Publicat: (2012)

Recent developments in FDR
per: Armstrong, P, et al.
Publicat: (2012)

Recent developments in FDR
per: Armstrong, P, et al.
Publicat: (2012)

Recent Developments in FDR
per: Armstrong, P, et al.
Publicat: (2012)

Undecidability of universality for timed automata with minimal resources
per: Adams, S, et al.
Publicat: (2007)

On LTL model-checking for low-dimensional discrete linear dynamical systems
per: Karimov, T, et al.
Publicat: (2020)

First-order orbit queries
per: Almagor, S, et al.
Publicat: (2020)