scientific article; zbMATH DE number 4191145
From MaRDI portal
zbMATH Open0722.68085MaRDI QIDQ3210197FDOQ3210197
Authors: José Meseguer, Ugo Montanari, Pierpaolo Degano 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (31)
- Spreading nets: a uniform approach to unfoldings
- Rewriting logic as a semantic framework for concurrency: a progress report
- Linear logic as a logic of computations
- Petri nets are monoids
- A trace semantics for Petri Nets
- An algebraic semantics for structured transition systems and its application to logic programs
- Petri nets, Horn programs, linear logic and vector games
- Petri nets based on Lawvere theories
- Zero-safe nets: Comparing the collective and individual token approaches.
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algebraic characterization of independence of Petri net processes
- Process versus unfolding semantics for Place/Transition Petri nets
- Title not available (Why is that?)
- Abstract processes and conflicts in place/transition systems
- On causal semantics of Petri nets (extended abstract)
- Contextual Petri nets, asymmetric event structures, and processes
- On continuous time agents
- Open Petri nets
- The category of typed graph grammars and its adjunctions with categories of derivations
- Declarative operations on nets
- Axiomatizing Petri net concatenable processes
- An algebraic view of interleaving and distributed operational semantics for CCS
- On the category of Petri net computations
- Conditional rewriting logic as a unified model of concurrency
- From Petri nets to linear logic
- Processes of timed Petri nets
- Petri nets are dioids: a new algebraic foundation for non-deterministic net theory
- An axiomatization of the algebra of Petri net concatenable processes
- On the implementation of concurrent calculi in net calculi: two case studies
- Timing Petri nets categorically
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 Q3210197)
