Search results for "marked graphs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
4	Javier Campos, José Manuel Colom, Hauke Jungnitz, Manuel Silva	Approximate Throughput Computation of Stochastic Marked Graphs.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	approximate throughput computation, stochastic marked graphs, stochastic strongly connected marked graphs, net decomposition, single input-single output cut, qualitative behavior, general decomposition technique, iterative response time approximation method, intractable systems, stochastic Petri net models, performance evaluation, Petri nets, error, stochastic processes, state space, iterative technique
3	Nathalie Sauer	Marking Optimization of Weighted Marked Graphs.	Discrete Event Dynamic Systems	2003	DBLP DOI BibTeX RDF	weighted marked graphs, marking optimization problem, timed Petri nets, flexible manufacturing systems
3	Matteo Sereno	Approximate Mean Value Analysis for Stochastic Marked Graphs.	IEEE Trans. Software Eng.	1996	DBLP DOI BibTeX RDF	approximate mean value analysis algorithm, Stochastic Petri nets, marked graphs, computational algorithms, approximation techniques
2	Lothar Thiele, Nikolay Stoimenov	Modular performance analysis of cyclic dataflow graphs.	EMSOFT	2009	DBLP DOI BibTeX RDF	dioid algebras, real-time systems, synchronous dataflow, marked graphs, real-time calculus
2	Juan Carlos González-Castolo, Ernesto López-Mellado	Marking estimation of fuzzy timed marked graphs.	SMC	2007	DBLP DOI BibTeX RDF
2	Mark Schäfer, Walter Vogler, Petr Jancar	Determinate STG Decomposition of Marked Graphs.	ICATPN	2005	DBLP DOI BibTeX RDF
2	Mustapha Mostefaoui, Isabel Demongodin, Nathalie Sauer	Transitory state of neutral continuous marked graphs.	SMC	2004	DBLP DOI BibTeX RDF
2	Leila Toursi, Nathalie Sauer	Branch and bound approach for marking optimization problem of weighted marked graphs.	SMC	2004	DBLP DOI BibTeX RDF
2	Jürgen Teich, Lothar Thiele, Edward A. Lee	Modeling and simulation of heterogeneous real-time systems based on a deterministic discrete event model.	ISSS	1995	DBLP DOI BibTeX RDF	Ptolemy design system, deterministic discrete event model, heterogeneous real-time systems, mixed asynchronous/synchronous systems, schedule constraints, synchronously clocked systems, timed marked graphs, simulation, modeling, real-time systems, discrete event simulation, timing analysis, finite buffering, self-timed systems
2	Hatem Sellami, Sudhakar Yalamanchili	Parallelism in Sequential Multiprocessor Simulation Models: A Case Study.	ACM Trans. Model. Comput. Simul.	1995	DBLP DOI BibTeX RDF	partitioning and mapping, Petri nets, parallelism, parallel architectures, discrete event simulation, parallel simulation, marked graphs, conservative synchronization
2	Yaron Wolfstahl, Michael Yoeli	An Equivalence Theorem for Labeled Marked Graphs.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	equivalence theorem, labeledmarked graphs, structural determinism, sequential language, firing sequences, Petri nets, Petri nets, multiprocessing systems, formal languages, transitions, concurrent language
2	Sergio Rajsbaum, Moshe Sidi	On the Performance of Synchronized Programs in Distributed Networks with Random Processing Times and Transmission Delays.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	randomprocessing times, synchronous network, message transmissiondelays, computational steps, probabilitydistributions, bottleneck processor, performance evaluation, parallel programming, compiler, distributed computing, synchronizer, graph theory, message passing, performance measure, synchronisation, program compilers, distributed networks, synchronized programs, processing times, asynchronous network, random variables, transmission delays, exponential distribution, marked graphs
2	Enrique Teruel, Piotr Chrzastowski-Wachtel, José Manuel Colom, Manuel Silva	On Weighted T-Systems.	Application and Theory of Petri Nets	1992	DBLP DOI BibTeX RDF	weighted T-graphs, Structure theory, Marked Graphs
2	Javier Campos, Giovanni Chiola, Manuel Silva	Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	persistent nets, throughput bounds, unique consistent firing count vector, mono-T-semiflow net subclasses, incidence matrix, synchronized queuing networks, Petri nets, Petri nets, linear programming, linear programming, ergodicity, marked graphs
1	Jean-Vivien Millo, Robert de Simone	Periodic scheduling of marked graphs using balanced binary words	CoRR	2012	DBLP BibTeX RDF
1	Chien-Liang Chen, Shao-Chi Chin, Hsu-Chun Yen	Reachability Analysis of Augmented Marked Graphs via Integer Linear Programming.	Comput. J.	2010	DBLP DOI BibTeX RDF
1	Jorge Júlvez, Jordi Cortadella, Michael Kishinevsky	On the Performance Evaluation of Multi-Guarded Marked Graphs with Single-Server Semantics.	Discrete Event Dynamic Systems	2010	DBLP DOI BibTeX RDF
1	Ricardo J. Rodríguez, Jorge Júlvez	Accurate Performance Estimation for Stochastic Marked Graphs by Bottleneck Regrowing.	EPEW	2010	DBLP DOI BibTeX RDF
1	Francesco Basile, Laura Recalde, Pasquale Chiacchio, Manuel Silva	Closed-loop Live Marked Graphs under Generalized Mutual Exclusion Constraint Enforcement.	Discrete Event Dynamic Systems	2009	DBLP DOI BibTeX RDF
1	King-Sing Cheung	Augmented Marked Graphs.	Informatica (Slovenia)	2008	DBLP BibTeX RDF
1	Leslie Lamport	Implementing dataflow with threads.	Distributed Computing	2008	DBLP DOI BibTeX RDF	Multiprocess synchronization, Dataflow, Marked graphs
1	Eike Best	A Note on Persistent Petri Nets.	Concurrency, Graphs and Models	2008	DBLP DOI BibTeX RDF
1	Jordi Cortadella, Michael Kishinevsky, Dmitry Bufistov, Josep Carmona, Jorge Júlvez	Elasticity and Petri Nets.	T. Petri Nets and Other Models of Concurrency	2008	DBLP DOI BibTeX RDF
1	K. S. Cheung	Boundedness and conservativeness of augmented marked graphs.	IMA J. Math. Control & Information	2007	DBLP DOI BibTeX RDF
1	Dmitry Bufistov, Jordi Cortadella, Michael Kishinevsky, Sachin S. Sapatnekar	A general model for performance optimization of sequential systems.	ICCAD	2007	DBLP DOI BibTeX RDF
1	C. J. Perez-Jimenez, J. Campos, M. Silva	Approximate Throughput Computation of Stochastic Weighted T-Systems.	IEEE Transactions on Systems, Man, and Cybernetics, Part A	2007	DBLP DOI BibTeX RDF
1	Benoit Trouillet, Ouajdi Korbaa, Jean-Claude Gentina	Formal Approach of FMS Cyclic Scheduling.	IEEE Transactions on Systems, Man, and Cybernetics, Part C	2007	DBLP DOI BibTeX RDF
1	K. S. Cheung, K. O. Chow	Property-Preserving Composition of Distributed System Components.	APPT	2007	DBLP DOI BibTeX RDF
1	Leslie Lamport	DISC 20th Anniversary: Invited Talk Time, Clocks, and the Ordering of My Ideas About Distributed Systems.	DISC	2007	DBLP DOI BibTeX RDF
1	Sunan Tugsinavisut, Roger Su, Peter A. Beerel	High-level Synthesis for Highly Concurrent Hardware Systems.	ACSD	2006	DBLP DOI BibTeX RDF
1	Chuanliang Xia	Analysis of Properties of Petri Synthesis Net.	TAMC	2006	DBLP DOI BibTeX RDF	liveness and boundedness, Petri nets, synthesis, analysis
1	Samir Hamaci, Jean-Louis Boimond, Sébastien Lahaye	Modeling and Control of Hybrid Timed Event Graphs with Multipliers Using (Min, +) Algebra.	Discrete Event Dynamic Systems	2006	DBLP DOI BibTeX RDF	Hybrid timed event graph, (min, +) algebra, Just-in-time control
1	K. S. Cheung, K. O. Chow	Cycle inclusion property of augmented marked graphs.	Inf. Process. Lett.	2005	DBLP DOI BibTeX RDF
1	K. S. Cheung, K. O. Chow	Analysis of Manufacturing Systems Based on Augmented Marked Graphs.	CIMCA/IAWTIC	2005	DBLP BibTeX RDF
1	Peggy B. McGee, Steven M. Nowick, Edward G. Coffman Jr.	Efficient performance analysis of asynchronous systems based on periodicity.	CODES+ISSS	2005	DBLP DOI BibTeX RDF	performance, asynchronous, periodic, marked graphs, petrinets
1	David Orden, Francisco Santos	The Polytope of Non-Crossing Graphs on a Planar Point Set.	Discrete & Computational Geometry	2005	DBLP DOI BibTeX RDF
1	K. S. Cheung	New characterization for live and reversible augmented marked graphs.	Inf. Process. Lett.	2004	DBLP DOI BibTeX RDF
1	David Orden, Francisco Santos	The polytope of non-crossing graphs on a planar point set.	ISSAC	2004	DBLP DOI BibTeX RDF	non-crossing graphs, polytope
1	Yi-Sheng Huang, Xiaolan Xie, Chien-Nin Hsu	Modeling and Analysis of Manufacturing Systems using a New class of Petri Nets.	ICRA	2004	DBLP DOI BibTeX RDF
1	Philippe Darondeau, X. Xie	Linear control of live marked graphs.	Automatica	2003	DBLP DOI BibTeX RDF
1	Fred S. Roberts, Shaoji Xu	Characterizations of Consistent Marked Graphs.	Discrete Applied Mathematics	2003	DBLP DOI BibTeX RDF
1	H. J. Huang, Li Jiao, To-Yat Cheung	Property-preserving composition of augmented marked graphs that share common resources.	ICRA	2003	DBLP BibTeX RDF
1	Leslie Lamport	Arbitration-free synchronization.	Distributed Computing	2003	DBLP DOI BibTeX RDF	Multiprocess synchronization, Arbiter, Marked graphs
1	Filippo Furfaro	Querying Semi-Structured Data with Graph Grammars.	ITCC	2002	DBLP DOI BibTeX RDF	Query language, Graph grammar, Semi-structured data
1	Karsten Strehl, Lothar Thiele, Matthias Gries, Dirk Ziegenbein, Rolf Ernst, Jürgen Teich	FunState-an internal design representation for codesign.	IEEE Trans. VLSI Syst.	2001	DBLP DOI BibTeX RDF
1	Fred S. Roberts	On balanced signed graphs and consistent marked graphs.	Electronic Notes in Discrete Mathematics	1999	DBLP DOI BibTeX RDF
1	K. Tsuji	Structural properties for transformation of extended marked graphs.	ISCAS	1999	DBLP DOI BibTeX RDF
1	Lothar Thiele, Karsten Strehl, Dirk Ziegenbein, Rolf Ernst, Jürgen Teich	FunState - an internal design representation for codesign.	ICCAD	1999	DBLP BibTeX RDF
1	Jürgen Teich, Lothar Thiele, Sundararajan Sriram, Michael Martin	Performance analysis and optimization of mixed asynchronous synchronous systems.	IEEE Trans. on CAD of Integrated Circuits and Systems	1997	DBLP DOI BibTeX RDF
1	Daniel H. Linder, James C. Harden	Phased Logic Supporting the Synchronous Design Paradigm with Delay-Insensitive Circuitry.	IEEE Trans. Computers	1996	DBLP DOI BibTeX RDF	Asynchronous circuitry, delay-insensitive circuitry, dual-rail encoding, LEDR, phased logic, synchronous circuitry, data flow, marked graphs
1	Young U. Ryu	Logical Specification of Resource Consumption and Production. (PDF / PS)	HICSS	1996	DBLP DOI BibTeX RDF
1	K. Thirusangu, K. Rangarajan	A Note on the Construction of Marked Graphs.	Inf. Process. Lett.	1995	DBLP DOI BibTeX RDF
1	Sergio Rajsbaum	Upper and Lower Bounds for Stochastic Marked Graphs.	Inf. Process. Lett.	1994	DBLP DOI BibTeX RDF
1	MengChu Zhou	Reduction of Timed Marked Graphs and Its Applications to Manufacturing Systems.	ICRA	1994	DBLP BibTeX RDF
1	Hatem Sellami, James D. Allen, David E. Schimmel, Sudhakar Yalamanchili	Simulation of Marked Graphs on SIMD Architectures Using Efficient Memory Management.	MASCOTS	1994	DBLP BibTeX RDF
1	Yves Dallery, Zhen Liu, Donald F. Towsley	Equivalence, Reversibility, Symmetry and Concavity Properties in Fork-Join Queueing Networks with Blocking.	J. ACM	1994	DBLP DOI BibTeX RDF	Fork-Join queuing networks, blocking before service, throughput, symmetry, duality, queuing theory, equivalence, marked graphs, concavity
1	François Baccelli, Miguel Canales	Parallel Simulation of Stochastic Petri Nets Using Recurrence Equations.	ACM Trans. Model. Comput. Simul.	1993	DBLP DOI BibTeX RDF	(max, +)-algebra, SIMD simulation, acceleration of simulations, job shop model, parallel prefix algorithm, stochastic marked graphs
1	Marija Cubric, Prakash Panangaden	Minimal Memory Schedules for Dataflow Networks.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Hauke Jungnitz, Beatriz Sánchez, Manuel Silva	Approximate Throughput Computation of Stohastic Marked Graphs.	J. Parallel Distrib. Comput.	1992	DBLP DOI BibTeX RDF
1	Vanio M. Savi, Xiaolan Xie	Liveness and Boundedness Analysis for Petri Nets with Event Graph Modules.	Application and Theory of Petri Nets	1992	DBLP DOI BibTeX RDF
1	Sergio Rajsbaum	Stochastic Marked Graphs.	PNPM	1991	DBLP BibTeX RDF
1	Jan Magott, Kamil Skudlarski	Estimating the Mean Cycle Time for Stochastic Safe Marked Graphs.	PNPM	1991	DBLP BibTeX RDF
1	Eike Best, Javier Esparza	Model Checking of Persistent Petri Nets.	CSL	1991	DBLP DOI BibTeX RDF
1	Yossi Malka, Sergio Rajsbaum	Analysis of Distributed Algorithms based on Recurrence Relations (Preliminary Version).	WDAG	1991	DBLP DOI BibTeX RDF
1	Javier Campos, Giovanni Chiola, José Manuel Colom, Manuel Silva	Tight Polynomial Bounds for Steady-State Performance of Marked Graphs.	PNPM	1989	DBLP BibTeX RDF
1	Wolfgang Henhapl	A Transformation of Marked Graphs.	Inf. Process. Lett.	1973	DBLP DOI BibTeX RDF