Applications and Theory of Petri Nets 2004
From MaRDI portal
Publication:5712345
DOI10.1007/b98283zbMath1094.68594OpenAlexW2495597431WikidataQ56892631 ScholiaQ56892631MaRDI QIDQ5712345
Publication date: 23 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98283
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (10)
Formal verification of real-time systems with preemptive scheduling ⋮ A process algebraic approach to the schedulability analysis and workload abstraction of hierarchical real-time systems ⋮ Reachability problems and abstract state spaces for time Petri nets with stopwatches ⋮ Time distance-based computation of the \textit{DBM} over-approximation of preemptive real-time systems ⋮ Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper) ⋮ Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets ⋮ Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph ⋮ Relational structures model of concurrency ⋮ Post and pre-initialized stopwatch Petri nets: formal semantics and state space computation ⋮ Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques
This page was built for publication: Applications and Theory of Petri Nets 2004