Recoverability of Communication Protocols--Implications of a Theoretical Study
From MaRDI portal
Publication:4136583
DOI10.1109/TCOM.1976.1093424zbMATH Open0362.68096MaRDI QIDQ4136583FDOQ4136583
Philip M. Merlin, David J. Farber
Publication date: 1976
Published in: IEEE Transactions on Communications (Search for Journal in Brave)
General topics in the theory of software (68N01) Formal languages and automata (68Q45) Algorithms in computer science (68W99)
Cited In (61)
- A generic causal model for place latency.
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
- The synthesis of communication protocols
- A temporal logic for micro- and macro-step-based real-time systems: foundations and applications
- Approximated timed reachability graphs for the robust control of discrete event systems
- A causal semantic for time Petri nets
- A time Petri net-based approach for synchronization, analysis and management of multimedia scenarios
- On-the-fly \(TCTL\) model checking for time Petri nets
- Scheduling and control of real-time systems based on a token player approach
- Time-based expressivity of time Petri nets for system specification
- Mapping timed cause-effect structures into timed Petri nets
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
- Fuzzy timed Petri nets - analysis and implementation
- Fuzzy timed Petri net definitions, properties, and applications
- Dealing with zero-time transitions in axiom systems.
- A theory of implementation and refinement in timed Petri nets
- Nondeterministic probabilistic Petri net -- a new method to study qualitative and quantitative behaviors of system
- A process algebra of communicating shared resources with dense time and priorities
- Model checking time-dependent system specifications using time stream Petri nets and \texttt{UPPAAL}
- Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
- Equivalence relations for modular performance evaluation in dtsPBC
- On the composition of time Petri nets
- Specification and analysis of timing requirements for real-time systems in the CBD approach
- On fluidization of discrete event models: Observation and control of continuous Petri nets
- Verifying time Petri nets by linear programming
- Interval timed coloured Petri net: efficient construction of its state class space preserving linear properties
- Verification of Timed-Arc Petri Nets
- Distributed simulation of modular time Petri nets: An approach and a case study exploiting temporal uncertainty
- A brief survey and synthesis of the roles of time in Petri nets.
- TIC: a tImed calculus
- A control synthesis approach for time discrete event systems
- Formal synthesis of real-time embedded software by time-memory scheduling of colored time Petri nets
- Time processes for time Petri nets
- Contraction of the ITCPN state space
- Efficient verification of a class of time Petri nets using linear programming
- `True concurrency' semantics for time Petri nets with weak time and persistent atomic policies
- Faster asynchronous systems.
- Computing branching distances with quantitative games
- An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions
- A COTS-based approach for estimating performance and energy consumption of embedded real-time systems
- Hard real-time tasks' scheduling considering voltage scaling, precedence and exclusion relations
- Full simulation coverage for SystemC transaction-level models of systems-on-a-chip
- Performance evaluation in stochastic process algebra dtsdPBC
- Decentralized state estimation and diagnosis of p-time labeled Petri nets systems
- Flexible nets: a modeling formalism for dynamic systems with uncertain parameters
- Discrete time stochastic and deterministic Petri box calculus dtsdPBC
- Dynamic Networks of Timed Petri Nets
- Model checking of systems with many identical timed processes
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
- CTL* model checking for time Petri nets
- Petri nets for modelling metabolic pathways: a survey
- A wide-spectrum language for object-based development of real-time systems
- Causal behaviours and nets
- Qualitative simulation of temporal concurrent processes using time interval Petri nets
- Performance preserving equivalence for stochastic process algebra dtsdPBC
- Reconfigurable timed graphs for the design of optimal scheduling in uncertain environments based on transition-timed Petri net
- State estimation for constant-time labeled automata under dense time
- Concurrency and Time in Role-Based Access Control
- Petri net‐based modeling and performance analysis of transaction scheduling in grid database
- Liveness enforcement for production systems modeled by time Petri nets
This page was built for publication: Recoverability of Communication Protocols--Implications of a Theoretical Study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136583)