Modular construction and partial order semantics of Petri nets

DOI10.1007/3-540-55767-9zbMath1293.68015OpenAlexW1553245026MaRDI QIDQ396979

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

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (50)

A partial trace semantics for Petri nets ⋮ Behavioural characterizations of partial order logics ⋮ Timed testing of concurrent systems ⋮ Encoding Asynchronous Interactions Using Open Petri Nets ⋮ A compositional framework to the specification of service protocols controllability and substitutability ⋮ Languages of higher-dimensional automata ⋮ Fair testing ⋮ Convolution and concurrency ⋮ A theory of implementation and refinement in timed Petri nets ⋮ Causality and true concurrency: A data-flow analysis of the Pi-Calculus ⋮ Posets with interfaces as a model for concurrency ⋮ A fully abstract semantics for termination in Petri nets ⋮ Generating Posets Beyond N ⋮ Undecidability of accordance for open systems with unbounded message queues ⋮ Projection approaches to process mining using region-based techniques ⋮ Faster asynchronous systems. ⋮ A trace-based service semantics guaranteeing deadlock freedom ⋮ Modal Open Petri Nets ⋮ A model of context-dependent component connectors ⋮ A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories ⋮ Trace- and failure-based semantics for responsiveness ⋮ Non sequential semantics for contextual P/T nets ⋮ Undecidability of bisimilarity for Petri nets and some related problems ⋮ Fairness and partial order semantics ⋮ Refinement of Synchronizable Places with Multi-workflow Nets ⋮ The limit of splitn-language equivalence ⋮ Truly concurrent constraint programming ⋮ Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Relating fair testing and accordance for service replaceability ⋮ Fast asynchronous systems in dense time ⋮ Nonprimitive recursive complexity and undecidability for Petri net equivalences ⋮ On Finite Bases for Weak Semantics: Failures Versus Impossible Futures ⋮ Fairness of actions in system computations ⋮ Petri net reactive modules ⋮ Asynchronous communication of Petri Nets and the refinement of transitions ⋮ A linear-time-branching-time spectrum for behavioral specification theories ⋮ Error-pruning in interface automata ⋮ M-nets: a survey ⋮ Executability of scenarios in Petri nets ⋮ Deciding Substitutability of Services with Operating Guidelines ⋮ Causality in Bounded Petri Nets is MSO Definable ⋮ Simple Composition of Nets ⋮ Pomset Languages of Finite Step Transition Systems ⋮ A process algebra with distributed priorities ⋮ Stubborn Sets, Frozen Actions, and Fair Testing ⋮ Truly concurrent constraint programming ⋮ Efficiency of asynchronous systems, read arcs, and the MUTEX-problem ⋮ Partial order semantics and read arcs ⋮ Firing partial orders in a Petri net

This page was built for publication: Modular construction and partial order semantics of Petri nets