Modular construction and partial order semantics of Petri nets
From MaRDI portal
(Redirected from Publication:396979)
Recommendations
Cited in
(57)- Undecidability of accordance for open systems with unbounded message queues
- The limit of \(\operatorname{split}_n\)-language equivalence
- Trace- and failure-based semantics for responsiveness
- Projection approaches to process mining using region-based techniques
- Undecidability of bisimilarity for Petri nets and some related problems
- Non sequential semantics for contextual P/T nets
- scientific article; zbMATH DE number 1836392 (Why is no real title available?)
- Partial order semantics and read arcs
- Pomset Languages of Finite Step Transition Systems
- Firing partial orders in a Petri net
- Relating fair testing and accordance for service replaceability
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
- A fully abstract semantics for termination in Petri nets
- Asynchronous communication of Petri nets and the refinement of transitions
- Convolution and concurrency
- A process algebra with distributed priorities
- scientific article; zbMATH DE number 4064501 (Why is no real title available?)
- Stubborn Sets, Frozen Actions, and Fair Testing
- A model of context-dependent component connectors
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus
- A theory of implementation and refinement in timed Petri nets
- Truly concurrent constraint programming
- Fairness and partial order semantics
- M-nets: a survey
- Executability of scenarios in Petri nets
- Causality in bounded Petri nets is MSO definable
- Kleene theorem for higher-dimensional automata
- Fast asynchronous systems in dense time
- Modal Open Petri Nets
- 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
- A partial trace semantics for Petri nets
- Synthesis and Analysis of Petri Nets from Causal Specifications
- Faster asynchronous systems.
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
- Failures semantics and deadlocking of modular Petri nets
- Petri net reactive modules
- Languages of higher-dimensional automata
- Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
- Token trail semantics -- modeling behavior of Petri nets with labeled Petri nets
- Posets with interfaces as a model for concurrency
- Simple Composition of Nets
- A compositional framework to the specification of service protocols controllability and substitutability
- Truly concurrent constraint programming
- Deciding Substitutability of Services with Operating Guidelines
- Generating Posets Beyond N
- Fairness of actions in system computations
- Fair testing
- Behavioural characterizations of partial order logics
- A linear-time-branching-time spectrum for behavioral specification theories
- Nonprimitive recursive complexity and undecidability for Petri net equivalences
- A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories
- A Myhill-Nerode theorem for higher-dimensional automata
- Error-pruning in interface automata
- Ensuring liveness properties of distributed systems: open problems
- Timed testing of concurrent systems
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)
