scientific article; zbMATH DE number 1223710

From MaRDI portal
Publication:4219024

zbMath0909.68124MaRDI QIDQ4219024

Catherine Dufourd, Philippe Schnoebelen, Alain Finkel

Publication date: 15 November 1998


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Expired data collection in shared dataspaces., Ideal Abstractions for Well-Structured Transition Systems, Forward analysis and model checking for trace bounded WSTS, Operational semantics for Petri net components, Boundedness undecidability for synchronized nets, Synthesis of Petri Nets with Whole-Place Operations and Localities, Reduction rules for reset/inhibitor nets, Context-free commutative grammars with integer counters and resets, General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond, When to Move to Transfer Nets, On the Relationship between π-Calculus and Finite Place/Transition Petri Nets, Branch-well-structured transition systems and extensions, Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues, On selective unboundedness of VASS, Discrete Parameters in Petri Nets, Petri Nets with Structured Data, simpA: an agent-oriented approach for programming concurrent applications on top of Java, Dynamic Recursive Petri Nets, Handling infinitely branching well-structured transition systems, Undecidable problems in unreliable computations., Reachability problems in BioAmbients, What else is undecidable about loops?, Unnamed Item, Unnamed Item, Recent advances on reachability problems for valence systems (invited talk), Unnamed Item, A polynomial \(\lambda\)-bisimilar normalization for reset Petri nets, Tree Pattern Rewriting Systems, Discovery, Verification and Conformance of Workflows with Cancellation, Catalytic and communicating Petri nets are Turing complete, Expressive Power of Broadcast Consensus Protocols, Directed reachability for infinite-state systems, Recursive Petri nets, Process calculi as a tool for studying coordination, contracts and session types, Computable fixpoints in well-structured symbolic model checking, Unnamed Item, Soundness of workflow nets: classification, decidability, and analysis, A well-structured framework for analysing Petri net extensions, A classification of the expressive power of well-structured transition systems, Decidability and complexity of Petri nets with unordered data, On the \(\omega\)-language expressive power of extended Petri nets, Tree automata with one memory set constraints and cryptographic protocols, Well-structured transition systems everywhere!, About the decision of reachability for register machines, Unnamed Item, Unnamed Item, Parameterized verification of coverability in infinite state broadcast networks, Applying regions, Petri nets with name creation for transient secure association, On the Dynamics of PB Systems with Volatile Membranes, Parameterized verification of monotone information systems, A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations, Formal verification of complex business processes based on high-level Petri nets, General decidability results for asynchronous shared-memory programs: higher-order and beyond, Soundness-preserving reduction rules for reset workflow nets, Unnamed Item, On Petri Nets with Hierarchical Special Arcs, Verifying lossy channel systems has nonprimitive recursive complexity., Expand, enlarge and check: new algorithms for the coverability problem of WSTS, Looking at mean-payoff and total-payoff through windows, Coverability, Termination, and Finiteness in Recursive Petri Nets, Synthesis of (choice-free) reset nets