The following pages link to (Q3911403):
Displaying 50 items.
- On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity (Q272014) (← links)
- Concurrent abstract state machines (Q303691) (← links)
- Distinguishing between evidence and its explanations in the steering of atomic clocks (Q309343) (← links)
- Diagnosability of Petri nets with observation graphs (Q312654) (← links)
- Computing the reveals relation in occurrence nets (Q391112) (← links)
- Unconventional algorithms: complementarity of axiomatics and construction (Q406192) (← links)
- An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints (Q414857) (← links)
- Complexity results for weighted timed event graphs (Q429654) (← links)
- Step coverability algorithms for communicating systems (Q433351) (← links)
- Transforming web services choreographies with priorities and time constraints into prioritized-time colored Petri nets (Q436361) (← links)
- Exact and approximate approaches to the identification of stochastic MAX-plus-linear systems (Q481353) (← links)
- Verification of membrane systems with delays via Petri nets with delays (Q496035) (← links)
- Synchronization of a class of cyclic discrete-event systems describing legged locomotion (Q503026) (← links)
- Discrete-event diagnostic model for a distributed computational system. Independent chains (Q507111) (← links)
- The virtues of idleness: a decidable fragment of resource agent logic (Q514142) (← links)
- Reachability trees for high-level Petri nets (Q579940) (← links)
- Process semantics of general inhibitor nets (Q598184) (← links)
- Possibilistic Petri nets as a basis for agent service description language (Q598580) (← links)
- Petri nets for modelling metabolic pathways: a survey (Q609029) (← links)
- Extensional Petri net (Q667521) (← links)
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- Complexity results for 1-safe nets (Q672459) (← links)
- Constraint nets: a semantic model for hybrid dynamic systems (Q673883) (← links)
- Specification and automatic verification of self-timed queues (Q685115) (← links)
- Structure of concurrency (Q685384) (← links)
- Efficient simulation of hierarchical stochastic activity network models (Q686340) (← links)
- Event monitoring of parallel computations (Q747489) (← links)
- Analysis of Petri nets by partitioning: Splitting transitions (Q751853) (← links)
- Subset languages of Petri nets. I: The relationship to string languages and normal forms (Q788496) (← links)
- Global and local views of state fairness (Q804304) (← links)
- A taxonomy of fairness and temporal logic problems for Petri nets (Q805257) (← links)
- The parallel complexity of two problems on concurrency (Q811123) (← links)
- Building reduced Petri net models of discrete manufacturing systems (Q814230) (← links)
- Qualitative simulation of temporal concurrent processes using time interval Petri nets (Q814432) (← links)
- Fault diagnosis in discrete event systems modeled by partially observed Petri nets (Q843985) (← links)
- Reduction rules for reset/inhibitor nets (Q847264) (← links)
- Robustness analysis of Petri nets for assembly/disassembly processes with unreliable resources (Q856534) (← links)
- A formal mathematical framework for modeling probabilistic hybrid systems (Q870808) (← links)
- Cycles and communicating classes in membrane systems and molecular dynamics (Q872209) (← links)
- Macro liveness graph and liveness of \(\omega\)-independent unbounded nets (Q893846) (← links)
- Time variant dynamic models in diagnosing of real-time computer systems (Q895302) (← links)
- Toward a definition of fault analysis for Petri nets models (Q910240) (← links)
- High-level Petri-net model for a resource-sharing problem (Q918729) (← links)
- Graph models and mathematical programming in biochemical network analysis and metabolic engineering design (Q929163) (← links)
- Automating the transformation-based analysis of visual languages (Q973037) (← links)
- Bilinear system interconnections and generating series of weighted Petri nets (Q976183) (← links)
- Phase semantics and Petri net interpretation for resource-sensitive strong negation (Q1006444) (← links)
- Executability of scenarios in Petri nets (Q1006647) (← links)
- A sufficient condition for the liveness of weighted event graphs (Q1014950) (← links)
- On-line fault detection in discrete event systems by Petri nets and integer linear programming (Q1049168) (← links)
