Contextual nets
From MaRDI portal
Publication:1902298
DOI10.1007/BF01178907zbMATH Open0835.68084OpenAlexW2913376619MaRDI QIDQ1902298FDOQ1902298
Authors: Ugo Montanari, Francesca Rossi 
Publication date: 20 November 1995
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01178907
Recommendations
Cites Work
Cited In (59)
- On Interval Semantics of Inhibitor and Activator Nets
- Title not available (Why is that?)
- A reversible perspective on Petri nets and event structures
- Relating reversible Petri nets and reversible event structures, categorically
- McMillan’s Complete Prefix for Contextual Nets
- Interval traces with mutex relation
- Concurrency for Graph Grammars in a Petri net shell
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Title not available (Why is that?)
- The Complexity of Synthesis of b-Bounded Petri Nets
- Non sequential semantics for contextual P/T nets
- Pomset bisimulation and unfolding for reset Petri nets
- Rewriting logic as a semantic framework for concurrency: a progress report
- Efficiency of asynchronous systems and read arcs in petri nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partial order semantics and read arcs
- Event structures for Petri nets with persistence
- On interval process semantics of Petri nets with inhibitor arcs
- Synthesis of nets with inhibitor arcs
- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems
- Transition systems of Elementary Net Systems with inhibitor arcs
- Contextual occurrence nets and concurrent constraint programming
- Title not available (Why is that?)
- Executability of scenarios in Petri nets
- Unfolding semantics of graph transformation
- Branching cells for asymmetric event structures
- A framework for the verification of infinite-state graph transformation systems
- Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs
- Just testing
- Comparing three semantics for Linda-like languages
- Non-atomic transition firing in contextual nets
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
- Efficiency of Token-Passing MUTEX-Solutions — Some Experiments
- An abstract machine for concurrent modular systems: CHARM
- Mobile Petri nets
- Analysis issues in Petri nets with inhibitor arcs
- Interval semantics for Petri nets with inhibitor arcs
- Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
- Time and Fairness in a Process Algebra with Non-blocking Reading
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
- Catalytic and communicating Petri nets are Turing complete
- Contextual Petri nets, asymmetric event structures, and processes
- Domain and event structure semantics for Petri nets with read and inhibitor arcs
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
- Computational Science - ICCS 2004
- On the expressiveness of Linda coordination primitives.
- Models and emerging trends of concurrent constraint programming
- Asynchronous traces and open Petri nets
- A new operational representation of dependencies in event structures
- Normal forms for algebras of connections.
- Unifying Petri nets with restricted occurrence rule using partial algebra
- A Petri net view of covalent bonds
- Step semantics of Boolean nets
- Modeling biological gradient formation: combining partial differential equations and Petri nets
- Transforming dynamic condition response graphs to safe Petri nets
- Modeling concurrency with interval traces
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
This page was built for publication: Contextual nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902298)
