Modular construction and partial order semantics of Petri nets
DOI10.1007/3-540-55767-9zbMATH Open1293.68015OpenAlexW1553245026MaRDI QIDQ396979FDOQ396979
Authors: Walter Vogler 
Publication date: 14 August 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55767-9
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (56)
- Modal Open Petri Nets
- The limit of \(\operatorname{split}_n\)-language equivalence
- Undecidability of accordance for open systems with unbounded message queues
- Trace- and failure-based semantics for responsiveness
- Non sequential semantics for contextual P/T nets
- Title not available (Why is that?)
- Projection approaches to process mining using region-based techniques
- Undecidability of bisimilarity for Petri nets and some related problems
- Pomset Languages of Finite Step Transition Systems
- Partial order semantics and read arcs
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
- Firing partial orders in a Petri net
- A fully abstract semantics for termination in Petri nets
- Asynchronous communication of Petri nets and the refinement of transitions
- Relating fair testing and accordance for service replaceability
- Convolution and concurrency
- Title not available (Why is that?)
- A process algebra with distributed priorities
- Stubborn Sets, Frozen Actions, and Fair Testing
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus
- A model of context-dependent component connectors
- Truly concurrent constraint programming
- A theory of implementation and refinement in timed Petri nets
- Fairness and partial order semantics
- Causality in bounded Petri nets is MSO definable
- M-nets: a survey
- Executability of scenarios in Petri nets
- Fast asynchronous systems in dense time
- Encoding Asynchronous Interactions Using Open Petri Nets
- Refinement of synchronizable places with multi-workflow nets. Weak termination preserved!
- A trace-based service semantics guaranteeing deadlock freedom
- Synthesis and Analysis of Petri Nets from Causal Specifications
- A partial trace semantics for Petri nets
- Faster asynchronous systems.
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
- Languages of higher-dimensional automata
- Failures semantics and deadlocking of modular Petri nets
- Petri net reactive modules
- Token trail semantics -- modeling behavior of Petri nets with labeled Petri nets
- Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
- Posets with interfaces as a model for concurrency
- Simple Composition of Nets
- Truly concurrent constraint programming
- A compositional framework to the specification of service protocols controllability and substitutability
- Deciding Substitutability of Services with Operating Guidelines
- Generating Posets Beyond N
- Behavioural characterizations of partial order logics
- Nonprimitive recursive complexity and undecidability for Petri net equivalences
- Fairness of actions in system computations
- A linear-time-branching-time spectrum for behavioral specification theories
- Fair testing
- A Myhill-Nerode theorem for higher-dimensional automata
- A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories
- Error-pruning in interface automata
- Timed testing of concurrent systems
- Ensuring liveness properties of distributed systems: open problems
This page was built for publication: Modular construction and partial order semantics of Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396979)
