The following pages link to Stefan Haar (Q314811):
Displaying 50 items.
- Optimal constructions for active diagnosis (Q314815) (← links)
- Belief, knowledge, lies and other utterances in an algebra for space and extrusion (Q347368) (← links)
- What topology tells us about diagnosability in partial order semantics (Q351726) (← links)
- Computing the reveals relation in occurrence nets (Q391112) (← links)
- A concurrency-preserving translation from time Petri nets to networks of timed automata (Q453542) (← links)
- Blocking a transition in a free choice net and what it tells about its throughput. (Q1401959) (← links)
- Boolean networks: beyond generalized asynchronicity (Q1656683) (← links)
- The complexity of diagnosability and opacity verification for Petri nets (Q1662539) (← links)
- Decoupling passenger flows for improved load prediction (Q1693113) (← links)
- Distributed monitoring of concurrent and asynchronous systems (Q1773098) (← links)
- Unfolding-based diagnosis of systems with an evolving topology (Q1959480) (← links)
- Drawing the line: basin boundaries in safe Petri nets (Q2110681) (← links)
- Unfolding of parametric Boolean networks (Q2130572) (← links)
- Combining refinement of parametric models with goal-oriented reduction of dynamics (Q2287116) (← links)
- Sequential reprogramming of Boolean networks made practical (Q2326580) (← links)
- Parameter space abstraction and unfolding semantics of discrete regulatory networks (Q2422012) (← links)
- (Q2775863) (← links)
- Conformance Relations for Labeled Event Structures (Q2900182) (← links)
- Distributed Testing of Concurrent Systems: Vector Clocks to the Rescue (Q2938174) (← links)
- Non-atomic Transition Firing in Contextual Nets (Q2941146) (← links)
- (Q2963940) (← links)
- (Q3159192) (← links)
- A Canonical Contraction for Safe Petri Nets (Q3452474) (← links)
- Unfolding-Based Process Discovery (Q3460543) (← links)
- Unfolding-Based Diagnosis of Systems with an Evolving Topology (Q3541019) (← links)
- Monotonicity in Service Orchestrations (Q3636849) (← links)
- Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net (Q3648819) (← links)
- (Q4234767) (← links)
- (Q4458137) (← links)
- (Q4507817) (← links)
- (Q4583879) (← links)
- The Complexity of Diagnosability and Opacity Verification for Petri Nets (Q4686521) (← links)
- (Q4782042) (← links)
- (Q4813200) (← links)
- (Q4964715) (← links)
- Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets (Q4978967) (← links)
- (Q5090956) (← links)
- Relationship Between the Reprogramming Determinants of Boolean Networks and Their Interaction Graph (Q5204377) (← links)
- Temporal Reprogramming of Boolean Networks (Q5227328) (← links)
- Closed Sets in Occurrence Nets with Conflicts (Q5259237) (← links)
- Markov nets: probabilistic models for distributed and concurrent systems (Q5266681) (← links)
- Diagnosis of asynchronous discrete-event systems: a net unfolding approach (Q5266845) (← links)
- Building Occurrence Nets from Reveals Relations (Q5300614) (← links)
- Active Diagnosis for Probabilistic Systems (Q5410662) (← links)
- Languages, Decidability, and Complexity (Q5496920) (← links)
- Diagnosis with Petri Net Unfoldings (Q5496933) (← links)
- Foundations of Software Science and Computation Structures (Q5899084) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900555) (← links)
- Concurrency in Boolean networks (Q6151158) (← links)
- Taking complete finite prefixes to high level, symbolically (Q6535189) (← links)
