scientific article; zbMATH DE number 1302047

From MaRDI portal
Publication:4247290

zbMath0926.68087MaRDI QIDQ4247290

Javier Esparza

Publication date: 1998


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



Related Items (66)

Compact and efficiently verifiable models for concurrent systemsOn the Termination of Integer LoopsComputing Parameterized Invariants of Parameterized Petri NetsForward analysis and model checking for trace bounded WSTSStubborn versus structural reductions for Petri netsThe Complexity of Reversal-Bounded Model-CheckingComputation in networks of passively mobile finite-state sensorsParameterized model checking of rendezvous systemsOn reducing linearizability to state reachabilityLanguage Representability of Finite P/T NetsMerged processes: a new condensed representation of Petri net behaviourWaiting netsOn selective unboundedness of VASSUnnamed ItemUniversality in Infinite Petri NetsComputing the reveals relation in occurrence netsOn the High Complexity of Petri Nets $$\omega $$-LanguagesInterleaving vs True Concurrency: Some Instructive Security ExamplesPSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow NetsUndecidability of accordance for open systems with unbounded message queuesThe reachability problem for branching vector addition systems requires doubly-exponential spaceDecidability of Two Truly Concurrent Equivalences for Finite Bounded Petri NetsParameterized Analysis of Immediate Observation Petri NetsUnnamed ItemWaiting Nets: State Classes and TaxonomyTimed negotiationsUnnamed ItemSmall vertex cover makes Petri net coverability and boundedness easierDeciding Structural Liveness of Petri NetsOn the topological complexity of \(\omega\)-languages of non-deterministic Petri netsComparing the Expressiveness of Timed Automata and Timed Extensions of Petri NetsCatalytic and communicating Petri nets are Turing completeNegotiation as concurrency primitiveDeciding Fast Termination for Probabilistic VASS with NondeterminismPartial order reduction for reachability gamesTeam bisimilarity, and its associated modal logic, for BPP netsFinding cut-offs in leaderless rendez-vous protocols is easyDirected reachability for infinite-state systemsLong-Run Average Behavior of Vector Addition Systems with StatesAn Algorithm for Direct Construction of Complete Merged ProcessesThe virtues of idleness: a decidable fragment of resource agent logicComputable fixpoints in well-structured symbolic model checkingBouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithmSoundness of workflow nets: classification, decidability, and analysisInheritance of behaviorA parametric analysis of the state-explosion problem in model checkingUnnamed ItemOn the complexity of resource-bounded logicsThe complexity of verifying population protocolsReduction techniques for network validation in systems biologyA Rice-style theorem for parallel automataRegular Expressions with Counting: Weak versus Strong DeterminismParameterized Complexity Results for 1-safe Petri NetsMulti-Dimensional Long-Run Average Problems for Vector Addition Systems with StatesAnalyzing Reachability for Some Petri Nets With Fast Growing MarkingsA Practical Approach to Verification of Mobile Systems Using Net UnfoldingsStructural liveness of Petri nets is \textsc{ExpSpace}-hard and decidableEnergy Games in Multiweighted AutomataStructural soundness of workflow nets is decidableUnnamed ItemA valuation-based analysis of conflict-free Petri netsSoundness Verification of Data-Aware Process Models with Variable-to-Variable ConditionsOn the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite WordsThe complexity of achievement and maintenance problems in agent-based systemsBranching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent movesComputing parameterized invariants of parameterized Petri nets




This page was built for publication: