Contextual nets

DOI10.1007/BF01178907zbMath0835.68084OpenAlexW2913376619MaRDI QIDQ1902298

Francesca Rossi, Ugo Montanari

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

zbMATH Keywords

contextual nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (48)

Domain and event structure semantics for Petri nets with read and inhibitor arcs ⋮ Step semantics of Boolean nets ⋮ Unnamed Item ⋮ Asynchronous Traces and Open Petri Nets ⋮ Efficiency of asynchronous systems and read arcs in petri nets ⋮ Unfolding semantics of graph transformation ⋮ On Interval Process Semantics of Petri Nets with Inhibitor Arcs ⋮ Non-atomic Transition Firing in Contextual Nets ⋮ A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems ⋮ Synthesis of nets with inhibitor arcs ⋮ On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets ⋮ Just testing ⋮ Rewriting logic as a semantic framework for concurrency: a progress report ⋮ On Interval Semantics of Inhibitor and Activator Nets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Catalytic and communicating Petri nets are Turing complete ⋮ Non sequential semantics for contextual P/T nets ⋮ A framework for the verification of infinite-state graph transformation systems ⋮ On the parameterized complexity of the synthesis of Boolean nets with restricted place environments ⋮ Interval semantics for Petri nets with inhibitor arcs ⋮ Modeling concurrency with interval traces ⋮ Timed Petri nets and timed automata: On the discriminating power of Zeno sequences ⋮ Branching cells for asymmetric event structures ⋮ Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework ⋮ Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra ⋮ Concurrency for Graph Grammars in a Petri net shell ⋮ Unnamed Item ⋮ Time and Fairness in a Process Algebra with Non-blocking Reading ⋮ McMillan’s Complete Prefix for Contextual Nets ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs ⋮ Executability of scenarios in Petri nets ⋮ Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS ⋮ Modeling biological gradient formation: combining partial differential equations and Petri nets ⋮ Mobile Petri nets ⋮ A Petri net view of covalent bonds ⋮ Comparing three semantics for Linda-like languages ⋮ Normal forms for algebras of connections. ⋮ On the expressiveness of Linda coordination primitives. ⋮ Contextual Petri nets, asymmetric event structures, and processes ⋮ An abstract machine for concurrent modular systems: CHARM ⋮ Models and emerging trends of concurrent constraint programming ⋮ Analysis issues in Petri nets with inhibitor arcs ⋮ The Complexity of Synthesis of b-Bounded Petri Nets ⋮ Pomset bisimulation and unfolding for reset Petri nets ⋮ Efficiency of asynchronous systems, read arcs, and the MUTEX-problem ⋮ Partial order semantics and read arcs

Cites Work

• Structure of concurrency
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Contextual nets