Pages that link to "Item:Q396979"

The following pages link to Modular construction and partial order semantics of Petri nets (Q396979):

Displaying 48 items.

• Undecidability of accordance for open systems with unbounded message queues (Q402353) (← links)
• Projection approaches to process mining using region-based techniques (Q408692) (← links)
• A model of context-dependent component connectors (Q436387) (← links)
• Trace- and failure-based semantics for responsiveness (Q478516) (← links)
• Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
• Fairness and partial order semantics (Q672492) (← links)
• Fair testing (Q865623) (← links)
• Relating fair testing and accordance for service replaceability (Q974133) (← links)
• M-nets: a survey (Q1006339) (← links)
• Executability of scenarios in Petri nets (Q1006647) (← links)
• A theory of implementation and refinement in timed Petri nets (Q1128980) (← links)
• A process algebra with distributed priorities (Q1276244) (← links)
• A partial trace semantics for Petri nets (Q1341743) (← links)
• Faster asynchronous systems. (Q1401952) (← links)
• Truly concurrent constraint programming (Q1605181) (← links)
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem (Q1607225) (← links)
• Partial order semantics and read arcs (Q1608891) (← links)
• Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
• Firing partial orders in a Petri net (Q2117188) (← links)
• A linear-time-branching-time spectrum for behavioral specification theories (Q2291820) (← links)
• A trace-based service semantics guaranteeing deadlock freedom (Q2428498) (← links)
• Fairness of actions in system computations (Q2502272) (← links)
• Petri net reactive modules (Q2503287) (← links)
• Error-pruning in interface automata (Q2517232) (← links)
• Posets with interfaces as a model for concurrency (Q2672275) (← links)
• Causality in Bounded Petri Nets is MSO Definable (Q2820695) (← links)
• A compositional framework to the specification of service protocols controllability and substitutability (Q2921918) (← links)
• A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories (Q2971124) (← links)
• Refinement of Synchronizable Places with Multi-workflow Nets (Q3011886) (← links)
• Encoding Asynchronous Interactions Using Open Petri Nets (Q3184668) (← links)
• On Finite Bases for Weak Semantics: Failures Versus Impossible Futures (Q3599070) (← links)
• Deciding Substitutability of Services with Operating Guidelines (Q3623825) (← links)
• Simple Composition of Nets (Q3636838) (← links)
• Pomset Languages of Finite Step Transition Systems (Q3636841) (← links)
• Timed testing of concurrent systems (Q4630289) (← links)
• Non sequential semantics for contextual P/T nets (Q4633159) (← links)
• The limit of splitn-language equivalence (Q4645217) (← links)
• Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice (Q4923369) (← links)
• Stubborn Sets, Frozen Actions, and Fair Testing (Q4989170) (← links)
• Behavioural characterizations of partial order logics (Q5055959) (← links)
• Languages of higher-dimensional automata (Q5076390) (← links)
• Convolution and concurrency (Q5084483) (← links)
• Causality and true concurrency: A data-flow analysis of the Pi-Calculus (Q5096391) (← links)
• A fully abstract semantics for termination in Petri nets (Q5096896) (← links)
• Generating Posets Beyond N (Q5098715) (← links)
• Asynchronous communication of Petri Nets and the refinement of transitions (Q5204351) (← links)
• Fast asynchronous systems in dense time (Q5940928) (← links)
• Nonprimitive recursive complexity and undecidability for Petri net equivalences (Q5941099) (← links)